/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:45:22,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:45:22,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:45:22,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:45:22,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:45:22,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:45:22,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:45:22,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:45:22,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:45:22,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:45:22,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:45:22,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:45:22,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:45:22,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:45:22,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:45:22,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:45:22,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:45:22,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:45:22,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:45:22,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:45:22,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:45:22,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:45:22,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:45:22,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:45:22,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:45:22,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:45:22,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:45:22,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:45:22,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:45:22,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:45:22,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:45:22,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:45:22,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:45:22,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:45:22,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:45:22,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:45:22,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:45:22,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:45:22,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:45:22,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:45:22,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:45:22,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:45:22,527 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:45:22,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:45:22,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:45:22,532 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:45:22,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:45:22,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:45:22,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:45:22,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:45:22,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:45:22,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:45:22,533 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:45:22,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:45:22,533 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:45:22,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:45:22,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:45:22,535 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:45:22,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:45:22,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:45:22,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:45:22,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:45:22,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:45:22,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:45:22,536 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:45:22,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:45:22,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:45:22,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:45:22,838 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:45:22,839 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:45:22,839 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2020-07-18 00:45:22,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedc5e5c3/e50f7b22f92042fa8f9685af8bba1141/FLAGd96a90763 [2020-07-18 00:45:23,378 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:45:23,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2020-07-18 00:45:23,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedc5e5c3/e50f7b22f92042fa8f9685af8bba1141/FLAGd96a90763 [2020-07-18 00:45:23,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aedc5e5c3/e50f7b22f92042fa8f9685af8bba1141 [2020-07-18 00:45:23,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:45:23,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:45:23,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:45:23,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:45:23,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:45:23,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:45:23" (1/1) ... [2020-07-18 00:45:23,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49eb3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:23, skipping insertion in model container [2020-07-18 00:45:23,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:45:23" (1/1) ... [2020-07-18 00:45:23,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:45:23,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:45:24,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:45:24,024 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:45:24,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:45:24,217 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:45:24,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24 WrapperNode [2020-07-18 00:45:24,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:45:24,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:45:24,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:45:24,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:45:24,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... [2020-07-18 00:45:24,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:45:24,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:45:24,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:45:24,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:45:24,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:45:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:45:24,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:45:24,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:45:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:45:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:45:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:45:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:45:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:45:25,178 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:45:25,179 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-18 00:45:25,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:45:25 BoogieIcfgContainer [2020-07-18 00:45:25,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:45:25,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:45:25,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:45:25,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:45:25,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:45:23" (1/3) ... [2020-07-18 00:45:25,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d814550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:45:25, skipping insertion in model container [2020-07-18 00:45:25,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:45:24" (2/3) ... [2020-07-18 00:45:25,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d814550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:45:25, skipping insertion in model container [2020-07-18 00:45:25,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:45:25" (3/3) ... [2020-07-18 00:45:25,194 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2020-07-18 00:45:25,205 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:45:25,213 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:45:25,227 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:45:25,250 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:45:25,251 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:45:25,251 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:45:25,251 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:45:25,251 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:45:25,252 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:45:25,252 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:45:25,252 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:45:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2020-07-18 00:45:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 00:45:25,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:25,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:25,287 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1507146259, now seen corresponding path program 1 times [2020-07-18 00:45:25,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:25,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1046830029] [2020-07-18 00:45:25,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:25,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID [2020-07-18 00:45:25,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID [2020-07-18 00:45:25,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID [2020-07-18 00:45:25,541 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID [2020-07-18 00:45:25,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID [2020-07-18 00:45:25,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID [2020-07-18 00:45:25,543 INFO L280 TraceCheckUtils]: 6: Hoare triple {194#true} assume true; {194#true} is VALID [2020-07-18 00:45:25,543 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID [2020-07-18 00:45:25,547 INFO L263 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:25,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID [2020-07-18 00:45:25,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID [2020-07-18 00:45:25,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID [2020-07-18 00:45:25,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID [2020-07-18 00:45:25,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID [2020-07-18 00:45:25,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID [2020-07-18 00:45:25,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {194#true} assume true; {194#true} is VALID [2020-07-18 00:45:25,550 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID [2020-07-18 00:45:25,550 INFO L263 TraceCheckUtils]: 9: Hoare triple {194#true} call #t~ret21 := main(); {194#true} is VALID [2020-07-18 00:45:25,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#true} ~q~0 := 0; {194#true} is VALID [2020-07-18 00:45:25,551 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#true} havoc ~method_id~0; {194#true} is VALID [2020-07-18 00:45:25,551 INFO L280 TraceCheckUtils]: 12: Hoare triple {194#true} ~this_state~0 := 0; {194#true} is VALID [2020-07-18 00:45:25,552 INFO L280 TraceCheckUtils]: 13: Hoare triple {194#true} goto; {194#true} is VALID [2020-07-18 00:45:25,552 INFO L280 TraceCheckUtils]: 14: Hoare triple {194#true} assume !false; {194#true} is VALID [2020-07-18 00:45:25,552 INFO L280 TraceCheckUtils]: 15: Hoare triple {194#true} assume 0 == ~q~0; {194#true} is VALID [2020-07-18 00:45:25,553 INFO L280 TraceCheckUtils]: 16: Hoare triple {194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {194#true} is VALID [2020-07-18 00:45:25,553 INFO L280 TraceCheckUtils]: 17: Hoare triple {194#true} assume 0 != #t~nondet0; {194#true} is VALID [2020-07-18 00:45:25,554 INFO L280 TraceCheckUtils]: 18: Hoare triple {194#true} havoc #t~nondet0; {194#true} is VALID [2020-07-18 00:45:25,554 INFO L280 TraceCheckUtils]: 19: Hoare triple {194#true} ~method_id~0 := 3; {194#true} is VALID [2020-07-18 00:45:25,555 INFO L280 TraceCheckUtils]: 20: Hoare triple {194#true} assume false; {195#false} is VALID [2020-07-18 00:45:25,555 INFO L280 TraceCheckUtils]: 21: Hoare triple {195#false} assume !false; {195#false} is VALID [2020-07-18 00:45:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:25,561 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:25,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1046830029] [2020-07-18 00:45:25,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:25,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:45:25,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966990146] [2020-07-18 00:45:25,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-18 00:45:25,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:25,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:45:25,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:25,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:45:25,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:45:25,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:45:25,631 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 3 states. [2020-07-18 00:45:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:26,967 INFO L93 Difference]: Finished difference Result 369 states and 507 transitions. [2020-07-18 00:45:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:45:26,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-18 00:45:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:45:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2020-07-18 00:45:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:45:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2020-07-18 00:45:27,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 507 transitions. [2020-07-18 00:45:27,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:27,690 INFO L225 Difference]: With dead ends: 369 [2020-07-18 00:45:27,690 INFO L226 Difference]: Without dead ends: 178 [2020-07-18 00:45:27,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:45:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-18 00:45:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2020-07-18 00:45:28,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:28,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 178 states. [2020-07-18 00:45:28,334 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states. [2020-07-18 00:45:28,335 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 178 states. [2020-07-18 00:45:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:28,347 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2020-07-18 00:45:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-18 00:45:28,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:28,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:28,350 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states. [2020-07-18 00:45:28,350 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 178 states. [2020-07-18 00:45:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:28,361 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2020-07-18 00:45:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-18 00:45:28,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:28,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:28,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:28,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-07-18 00:45:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2020-07-18 00:45:28,375 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 22 [2020-07-18 00:45:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:28,376 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2020-07-18 00:45:28,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:45:28,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 178 states and 213 transitions. [2020-07-18 00:45:28,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-18 00:45:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-18 00:45:28,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:28,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:28,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:45:28,700 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -946920198, now seen corresponding path program 1 times [2020-07-18 00:45:28,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:28,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [979995646] [2020-07-18 00:45:28,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:28,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID [2020-07-18 00:45:28,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID [2020-07-18 00:45:28,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID [2020-07-18 00:45:28,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID [2020-07-18 00:45:28,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID [2020-07-18 00:45:28,804 INFO L280 TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID [2020-07-18 00:45:28,805 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-18 00:45:28,805 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID [2020-07-18 00:45:28,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:28,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID [2020-07-18 00:45:28,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID [2020-07-18 00:45:28,812 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID [2020-07-18 00:45:28,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID [2020-07-18 00:45:28,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID [2020-07-18 00:45:28,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID [2020-07-18 00:45:28,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-18 00:45:28,814 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID [2020-07-18 00:45:28,814 INFO L263 TraceCheckUtils]: 9: Hoare triple {1657#true} call #t~ret21 := main(); {1657#true} is VALID [2020-07-18 00:45:28,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {1657#true} ~q~0 := 0; {1667#(= 0 main_~q~0)} is VALID [2020-07-18 00:45:28,817 INFO L280 TraceCheckUtils]: 11: Hoare triple {1667#(= 0 main_~q~0)} havoc ~method_id~0; {1667#(= 0 main_~q~0)} is VALID [2020-07-18 00:45:28,817 INFO L280 TraceCheckUtils]: 12: Hoare triple {1667#(= 0 main_~q~0)} ~this_state~0 := 0; {1667#(= 0 main_~q~0)} is VALID [2020-07-18 00:45:28,822 INFO L280 TraceCheckUtils]: 13: Hoare triple {1667#(= 0 main_~q~0)} goto; {1667#(= 0 main_~q~0)} is VALID [2020-07-18 00:45:28,823 INFO L280 TraceCheckUtils]: 14: Hoare triple {1667#(= 0 main_~q~0)} assume !false; {1667#(= 0 main_~q~0)} is VALID [2020-07-18 00:45:28,824 INFO L280 TraceCheckUtils]: 15: Hoare triple {1667#(= 0 main_~q~0)} assume !(0 == ~q~0); {1658#false} is VALID [2020-07-18 00:45:28,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {1658#false} assume 1 == ~q~0; {1658#false} is VALID [2020-07-18 00:45:28,824 INFO L280 TraceCheckUtils]: 17: Hoare triple {1658#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1658#false} is VALID [2020-07-18 00:45:28,825 INFO L280 TraceCheckUtils]: 18: Hoare triple {1658#false} assume 0 != #t~nondet1; {1658#false} is VALID [2020-07-18 00:45:28,825 INFO L280 TraceCheckUtils]: 19: Hoare triple {1658#false} havoc #t~nondet1; {1658#false} is VALID [2020-07-18 00:45:28,825 INFO L280 TraceCheckUtils]: 20: Hoare triple {1658#false} ~method_id~0 := 4; {1658#false} is VALID [2020-07-18 00:45:28,826 INFO L280 TraceCheckUtils]: 21: Hoare triple {1658#false} assume 2 == ~this_state~0; {1658#false} is VALID [2020-07-18 00:45:28,826 INFO L280 TraceCheckUtils]: 22: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2020-07-18 00:45:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:28,829 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:28,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [979995646] [2020-07-18 00:45:28,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:28,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:28,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302979231] [2020-07-18 00:45:28,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-18 00:45:28,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:28,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:28,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:28,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:28,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:28,855 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand 4 states. [2020-07-18 00:45:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:30,277 INFO L93 Difference]: Finished difference Result 346 states and 417 transitions. [2020-07-18 00:45:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:30,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-18 00:45:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2020-07-18 00:45:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2020-07-18 00:45:30,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 417 transitions. [2020-07-18 00:45:30,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:30,780 INFO L225 Difference]: With dead ends: 346 [2020-07-18 00:45:30,781 INFO L226 Difference]: Without dead ends: 181 [2020-07-18 00:45:30,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-07-18 00:45:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-07-18 00:45:31,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:31,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 181 states. [2020-07-18 00:45:31,340 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states. [2020-07-18 00:45:31,340 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 181 states. [2020-07-18 00:45:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:31,349 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2020-07-18 00:45:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-18 00:45:31,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:31,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:31,351 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states. [2020-07-18 00:45:31,351 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 181 states. [2020-07-18 00:45:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:31,359 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2020-07-18 00:45:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-18 00:45:31,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:31,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:31,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:31,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-07-18 00:45:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2020-07-18 00:45:31,368 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23 [2020-07-18 00:45:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:31,369 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2020-07-18 00:45:31,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:31,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 216 transitions. [2020-07-18 00:45:31,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-18 00:45:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 00:45:31,664 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:31,665 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:31,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:45:31,665 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1840173547, now seen corresponding path program 1 times [2020-07-18 00:45:31,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:31,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [575604141] [2020-07-18 00:45:31,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:31,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID [2020-07-18 00:45:31,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID [2020-07-18 00:45:31,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID [2020-07-18 00:45:31,764 INFO L280 TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID [2020-07-18 00:45:31,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID [2020-07-18 00:45:31,765 INFO L280 TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID [2020-07-18 00:45:31,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {3089#true} assume true; {3089#true} is VALID [2020-07-18 00:45:31,765 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID [2020-07-18 00:45:31,771 INFO L263 TraceCheckUtils]: 0: Hoare triple {3089#true} call ULTIMATE.init(); {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:31,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID [2020-07-18 00:45:31,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID [2020-07-18 00:45:31,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID [2020-07-18 00:45:31,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID [2020-07-18 00:45:31,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID [2020-07-18 00:45:31,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID [2020-07-18 00:45:31,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {3089#true} assume true; {3089#true} is VALID [2020-07-18 00:45:31,773 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID [2020-07-18 00:45:31,773 INFO L263 TraceCheckUtils]: 9: Hoare triple {3089#true} call #t~ret21 := main(); {3089#true} is VALID [2020-07-18 00:45:31,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {3089#true} ~q~0 := 0; {3089#true} is VALID [2020-07-18 00:45:31,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {3089#true} havoc ~method_id~0; {3089#true} is VALID [2020-07-18 00:45:31,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {3089#true} ~this_state~0 := 0; {3089#true} is VALID [2020-07-18 00:45:31,775 INFO L280 TraceCheckUtils]: 13: Hoare triple {3089#true} goto; {3089#true} is VALID [2020-07-18 00:45:31,775 INFO L280 TraceCheckUtils]: 14: Hoare triple {3089#true} assume !false; {3089#true} is VALID [2020-07-18 00:45:31,775 INFO L280 TraceCheckUtils]: 15: Hoare triple {3089#true} assume 0 == ~q~0; {3089#true} is VALID [2020-07-18 00:45:31,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {3089#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3089#true} is VALID [2020-07-18 00:45:31,776 INFO L280 TraceCheckUtils]: 17: Hoare triple {3089#true} assume 0 != #t~nondet0; {3089#true} is VALID [2020-07-18 00:45:31,776 INFO L280 TraceCheckUtils]: 18: Hoare triple {3089#true} havoc #t~nondet0; {3089#true} is VALID [2020-07-18 00:45:31,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {3089#true} ~method_id~0 := 3; {3089#true} is VALID [2020-07-18 00:45:31,777 INFO L280 TraceCheckUtils]: 20: Hoare triple {3089#true} assume !false; {3089#true} is VALID [2020-07-18 00:45:31,780 INFO L280 TraceCheckUtils]: 21: Hoare triple {3089#true} ~q~0 := 2; {3099#(<= 2 main_~q~0)} is VALID [2020-07-18 00:45:31,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {3099#(<= 2 main_~q~0)} ~this_state~0 := 0; {3099#(<= 2 main_~q~0)} is VALID [2020-07-18 00:45:31,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {3099#(<= 2 main_~q~0)} assume !false; {3099#(<= 2 main_~q~0)} is VALID [2020-07-18 00:45:31,782 INFO L280 TraceCheckUtils]: 24: Hoare triple {3099#(<= 2 main_~q~0)} assume !(0 == ~q~0); {3099#(<= 2 main_~q~0)} is VALID [2020-07-18 00:45:31,788 INFO L280 TraceCheckUtils]: 25: Hoare triple {3099#(<= 2 main_~q~0)} assume 1 == ~q~0; {3090#false} is VALID [2020-07-18 00:45:31,789 INFO L280 TraceCheckUtils]: 26: Hoare triple {3090#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3090#false} is VALID [2020-07-18 00:45:31,789 INFO L280 TraceCheckUtils]: 27: Hoare triple {3090#false} assume 0 != #t~nondet1; {3090#false} is VALID [2020-07-18 00:45:31,789 INFO L280 TraceCheckUtils]: 28: Hoare triple {3090#false} havoc #t~nondet1; {3090#false} is VALID [2020-07-18 00:45:31,790 INFO L280 TraceCheckUtils]: 29: Hoare triple {3090#false} ~method_id~0 := 4; {3090#false} is VALID [2020-07-18 00:45:31,790 INFO L280 TraceCheckUtils]: 30: Hoare triple {3090#false} assume 2 == ~this_state~0; {3090#false} is VALID [2020-07-18 00:45:31,790 INFO L280 TraceCheckUtils]: 31: Hoare triple {3090#false} assume !false; {3090#false} is VALID [2020-07-18 00:45:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:31,793 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:31,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [575604141] [2020-07-18 00:45:31,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:31,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:31,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264085423] [2020-07-18 00:45:31,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-18 00:45:31,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:31,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:31,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:31,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:31,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:31,831 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 4 states. [2020-07-18 00:45:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:32,874 INFO L93 Difference]: Finished difference Result 330 states and 397 transitions. [2020-07-18 00:45:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:32,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-18 00:45:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2020-07-18 00:45:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2020-07-18 00:45:32,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 395 transitions. [2020-07-18 00:45:33,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:33,372 INFO L225 Difference]: With dead ends: 330 [2020-07-18 00:45:33,372 INFO L226 Difference]: Without dead ends: 163 [2020-07-18 00:45:33,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-07-18 00:45:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-07-18 00:45:33,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:33,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 163 states. [2020-07-18 00:45:33,953 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states. [2020-07-18 00:45:33,954 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 163 states. [2020-07-18 00:45:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:33,966 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2020-07-18 00:45:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-18 00:45:33,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:33,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:33,968 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states. [2020-07-18 00:45:33,968 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 163 states. [2020-07-18 00:45:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:33,985 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2020-07-18 00:45:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-18 00:45:33,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:33,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:33,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:33,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-07-18 00:45:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2020-07-18 00:45:33,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 32 [2020-07-18 00:45:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:33,999 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2020-07-18 00:45:33,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:34,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 163 states and 193 transitions. [2020-07-18 00:45:34,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-18 00:45:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:45:34,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:34,371 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:34,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:45:34,372 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash 576498569, now seen corresponding path program 1 times [2020-07-18 00:45:34,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:34,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776476916] [2020-07-18 00:45:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:34,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID [2020-07-18 00:45:34,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID [2020-07-18 00:45:34,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID [2020-07-18 00:45:34,470 INFO L280 TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID [2020-07-18 00:45:34,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID [2020-07-18 00:45:34,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID [2020-07-18 00:45:34,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#true} assume true; {4418#true} is VALID [2020-07-18 00:45:34,471 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID [2020-07-18 00:45:34,472 INFO L263 TraceCheckUtils]: 0: Hoare triple {4418#true} call ULTIMATE.init(); {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:34,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID [2020-07-18 00:45:34,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID [2020-07-18 00:45:34,473 INFO L280 TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID [2020-07-18 00:45:34,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID [2020-07-18 00:45:34,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID [2020-07-18 00:45:34,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID [2020-07-18 00:45:34,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {4418#true} assume true; {4418#true} is VALID [2020-07-18 00:45:34,474 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID [2020-07-18 00:45:34,475 INFO L263 TraceCheckUtils]: 9: Hoare triple {4418#true} call #t~ret21 := main(); {4418#true} is VALID [2020-07-18 00:45:34,475 INFO L280 TraceCheckUtils]: 10: Hoare triple {4418#true} ~q~0 := 0; {4418#true} is VALID [2020-07-18 00:45:34,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {4418#true} havoc ~method_id~0; {4418#true} is VALID [2020-07-18 00:45:34,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {4418#true} ~this_state~0 := 0; {4418#true} is VALID [2020-07-18 00:45:34,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {4418#true} goto; {4418#true} is VALID [2020-07-18 00:45:34,476 INFO L280 TraceCheckUtils]: 14: Hoare triple {4418#true} assume !false; {4418#true} is VALID [2020-07-18 00:45:34,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {4418#true} assume 0 == ~q~0; {4418#true} is VALID [2020-07-18 00:45:34,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {4418#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4418#true} is VALID [2020-07-18 00:45:34,477 INFO L280 TraceCheckUtils]: 17: Hoare triple {4418#true} assume 0 != #t~nondet0; {4418#true} is VALID [2020-07-18 00:45:34,477 INFO L280 TraceCheckUtils]: 18: Hoare triple {4418#true} havoc #t~nondet0; {4418#true} is VALID [2020-07-18 00:45:34,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {4418#true} ~method_id~0 := 3; {4418#true} is VALID [2020-07-18 00:45:34,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {4418#true} assume !false; {4418#true} is VALID [2020-07-18 00:45:34,478 INFO L280 TraceCheckUtils]: 21: Hoare triple {4418#true} ~q~0 := 2; {4418#true} is VALID [2020-07-18 00:45:34,479 INFO L280 TraceCheckUtils]: 22: Hoare triple {4418#true} ~this_state~0 := 0; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,479 INFO L280 TraceCheckUtils]: 23: Hoare triple {4428#(<= main_~this_state~0 0)} assume !false; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,480 INFO L280 TraceCheckUtils]: 24: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,480 INFO L280 TraceCheckUtils]: 25: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(1 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,481 INFO L280 TraceCheckUtils]: 26: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~q~0; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,482 INFO L280 TraceCheckUtils]: 27: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,482 INFO L280 TraceCheckUtils]: 28: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet4); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,483 INFO L280 TraceCheckUtils]: 29: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet4; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,483 INFO L280 TraceCheckUtils]: 30: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,484 INFO L280 TraceCheckUtils]: 31: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet5); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,485 INFO L280 TraceCheckUtils]: 32: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet5; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,485 INFO L280 TraceCheckUtils]: 33: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,486 INFO L280 TraceCheckUtils]: 34: Hoare triple {4428#(<= main_~this_state~0 0)} assume 0 != #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,487 INFO L280 TraceCheckUtils]: 35: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,487 INFO L280 TraceCheckUtils]: 36: Hoare triple {4428#(<= main_~this_state~0 0)} ~method_id~0 := 4; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-18 00:45:34,488 INFO L280 TraceCheckUtils]: 37: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~this_state~0; {4419#false} is VALID [2020-07-18 00:45:34,488 INFO L280 TraceCheckUtils]: 38: Hoare triple {4419#false} assume !false; {4419#false} is VALID [2020-07-18 00:45:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:34,494 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:34,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776476916] [2020-07-18 00:45:34,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:34,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:34,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599526850] [2020-07-18 00:45:34,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-18 00:45:34,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:34,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:34,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:34,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:34,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:34,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:34,535 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand 4 states. [2020-07-18 00:45:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:36,572 INFO L93 Difference]: Finished difference Result 429 states and 517 transitions. [2020-07-18 00:45:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:36,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-18 00:45:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2020-07-18 00:45:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2020-07-18 00:45:36,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 515 transitions. [2020-07-18 00:45:37,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:37,204 INFO L225 Difference]: With dead ends: 429 [2020-07-18 00:45:37,204 INFO L226 Difference]: Without dead ends: 275 [2020-07-18 00:45:37,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-18 00:45:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2020-07-18 00:45:38,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:38,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 243 states. [2020-07-18 00:45:38,064 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 243 states. [2020-07-18 00:45:38,064 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 243 states. [2020-07-18 00:45:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:38,075 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2020-07-18 00:45:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions. [2020-07-18 00:45:38,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:38,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:38,076 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 275 states. [2020-07-18 00:45:38,076 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 275 states. [2020-07-18 00:45:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:38,087 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2020-07-18 00:45:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions. [2020-07-18 00:45:38,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:38,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:38,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-07-18 00:45:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2020-07-18 00:45:38,098 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 39 [2020-07-18 00:45:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:38,098 INFO L479 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2020-07-18 00:45:38,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:38,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 243 states and 288 transitions. [2020-07-18 00:45:38,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2020-07-18 00:45:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 00:45:38,533 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:38,534 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:38,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:45:38,534 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash -47890514, now seen corresponding path program 1 times [2020-07-18 00:45:38,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:38,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758519195] [2020-07-18 00:45:38,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:38,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID [2020-07-18 00:45:38,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID [2020-07-18 00:45:38,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID [2020-07-18 00:45:38,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID [2020-07-18 00:45:38,626 INFO L280 TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID [2020-07-18 00:45:38,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID [2020-07-18 00:45:38,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {6329#true} assume true; {6329#true} is VALID [2020-07-18 00:45:38,627 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID [2020-07-18 00:45:38,628 INFO L263 TraceCheckUtils]: 0: Hoare triple {6329#true} call ULTIMATE.init(); {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:38,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID [2020-07-18 00:45:38,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID [2020-07-18 00:45:38,629 INFO L280 TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID [2020-07-18 00:45:38,629 INFO L280 TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID [2020-07-18 00:45:38,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID [2020-07-18 00:45:38,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID [2020-07-18 00:45:38,630 INFO L280 TraceCheckUtils]: 7: Hoare triple {6329#true} assume true; {6329#true} is VALID [2020-07-18 00:45:38,630 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID [2020-07-18 00:45:38,630 INFO L263 TraceCheckUtils]: 9: Hoare triple {6329#true} call #t~ret21 := main(); {6329#true} is VALID [2020-07-18 00:45:38,630 INFO L280 TraceCheckUtils]: 10: Hoare triple {6329#true} ~q~0 := 0; {6329#true} is VALID [2020-07-18 00:45:38,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {6329#true} havoc ~method_id~0; {6329#true} is VALID [2020-07-18 00:45:38,631 INFO L280 TraceCheckUtils]: 12: Hoare triple {6329#true} ~this_state~0 := 0; {6329#true} is VALID [2020-07-18 00:45:38,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {6329#true} goto; {6329#true} is VALID [2020-07-18 00:45:38,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2020-07-18 00:45:38,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {6329#true} assume 0 == ~q~0; {6329#true} is VALID [2020-07-18 00:45:38,632 INFO L280 TraceCheckUtils]: 16: Hoare triple {6329#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6329#true} is VALID [2020-07-18 00:45:38,632 INFO L280 TraceCheckUtils]: 17: Hoare triple {6329#true} assume 0 != #t~nondet0; {6329#true} is VALID [2020-07-18 00:45:38,632 INFO L280 TraceCheckUtils]: 18: Hoare triple {6329#true} havoc #t~nondet0; {6329#true} is VALID [2020-07-18 00:45:38,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {6329#true} ~method_id~0 := 3; {6329#true} is VALID [2020-07-18 00:45:38,633 INFO L280 TraceCheckUtils]: 20: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2020-07-18 00:45:38,637 INFO L280 TraceCheckUtils]: 21: Hoare triple {6329#true} ~q~0 := 2; {6339#(= 2 main_~q~0)} is VALID [2020-07-18 00:45:38,637 INFO L280 TraceCheckUtils]: 22: Hoare triple {6339#(= 2 main_~q~0)} ~this_state~0 := 0; {6339#(= 2 main_~q~0)} is VALID [2020-07-18 00:45:38,638 INFO L280 TraceCheckUtils]: 23: Hoare triple {6339#(= 2 main_~q~0)} assume !false; {6339#(= 2 main_~q~0)} is VALID [2020-07-18 00:45:38,638 INFO L280 TraceCheckUtils]: 24: Hoare triple {6339#(= 2 main_~q~0)} assume !(0 == ~q~0); {6339#(= 2 main_~q~0)} is VALID [2020-07-18 00:45:38,639 INFO L280 TraceCheckUtils]: 25: Hoare triple {6339#(= 2 main_~q~0)} assume !(1 == ~q~0); {6339#(= 2 main_~q~0)} is VALID [2020-07-18 00:45:38,639 INFO L280 TraceCheckUtils]: 26: Hoare triple {6339#(= 2 main_~q~0)} assume !(2 == ~q~0); {6330#false} is VALID [2020-07-18 00:45:38,639 INFO L280 TraceCheckUtils]: 27: Hoare triple {6330#false} assume 3 == ~q~0; {6330#false} is VALID [2020-07-18 00:45:38,640 INFO L280 TraceCheckUtils]: 28: Hoare triple {6330#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6330#false} is VALID [2020-07-18 00:45:38,640 INFO L280 TraceCheckUtils]: 29: Hoare triple {6330#false} assume !(0 != #t~nondet9); {6330#false} is VALID [2020-07-18 00:45:38,640 INFO L280 TraceCheckUtils]: 30: Hoare triple {6330#false} havoc #t~nondet9; {6330#false} is VALID [2020-07-18 00:45:38,640 INFO L280 TraceCheckUtils]: 31: Hoare triple {6330#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {6330#false} is VALID [2020-07-18 00:45:38,640 INFO L280 TraceCheckUtils]: 32: Hoare triple {6330#false} assume !(0 != #t~nondet10); {6330#false} is VALID [2020-07-18 00:45:38,641 INFO L280 TraceCheckUtils]: 33: Hoare triple {6330#false} havoc #t~nondet10; {6330#false} is VALID [2020-07-18 00:45:38,641 INFO L280 TraceCheckUtils]: 34: Hoare triple {6330#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {6330#false} is VALID [2020-07-18 00:45:38,641 INFO L280 TraceCheckUtils]: 35: Hoare triple {6330#false} assume 0 != #t~nondet11; {6330#false} is VALID [2020-07-18 00:45:38,641 INFO L280 TraceCheckUtils]: 36: Hoare triple {6330#false} havoc #t~nondet11; {6330#false} is VALID [2020-07-18 00:45:38,642 INFO L280 TraceCheckUtils]: 37: Hoare triple {6330#false} ~method_id~0 := 4; {6330#false} is VALID [2020-07-18 00:45:38,642 INFO L280 TraceCheckUtils]: 38: Hoare triple {6330#false} assume 2 != ~this_state~0; {6330#false} is VALID [2020-07-18 00:45:38,642 INFO L280 TraceCheckUtils]: 39: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2020-07-18 00:45:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:38,645 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:38,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758519195] [2020-07-18 00:45:38,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:38,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:38,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231992208] [2020-07-18 00:45:38,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-18 00:45:38,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:38,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:38,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:38,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:38,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:38,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:38,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:38,685 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand 4 states. [2020-07-18 00:45:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:40,043 INFO L93 Difference]: Finished difference Result 407 states and 484 transitions. [2020-07-18 00:45:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:40,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-18 00:45:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2020-07-18 00:45:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2020-07-18 00:45:40,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 365 transitions. [2020-07-18 00:45:40,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:40,471 INFO L225 Difference]: With dead ends: 407 [2020-07-18 00:45:40,471 INFO L226 Difference]: Without dead ends: 188 [2020-07-18 00:45:40,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-18 00:45:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-07-18 00:45:41,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:41,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2020-07-18 00:45:41,164 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2020-07-18 00:45:41,164 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2020-07-18 00:45:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:41,169 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2020-07-18 00:45:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2020-07-18 00:45:41,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:41,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:41,170 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2020-07-18 00:45:41,171 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2020-07-18 00:45:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:41,176 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2020-07-18 00:45:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2020-07-18 00:45:41,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:41,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:41,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:41,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-07-18 00:45:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2020-07-18 00:45:41,182 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 40 [2020-07-18 00:45:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:41,183 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2020-07-18 00:45:41,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:41,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 186 states and 218 transitions. [2020-07-18 00:45:41,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2020-07-18 00:45:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 00:45:41,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:41,518 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:41,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:45:41,518 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:41,519 INFO L82 PathProgramCache]: Analyzing trace with hash 946604760, now seen corresponding path program 1 times [2020-07-18 00:45:41,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:41,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531160704] [2020-07-18 00:45:41,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:41,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID [2020-07-18 00:45:41,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID [2020-07-18 00:45:41,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID [2020-07-18 00:45:41,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID [2020-07-18 00:45:41,601 INFO L280 TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID [2020-07-18 00:45:41,601 INFO L280 TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID [2020-07-18 00:45:41,601 INFO L280 TraceCheckUtils]: 6: Hoare triple {7908#true} assume true; {7908#true} is VALID [2020-07-18 00:45:41,602 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID [2020-07-18 00:45:41,603 INFO L263 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:41,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID [2020-07-18 00:45:41,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID [2020-07-18 00:45:41,604 INFO L280 TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID [2020-07-18 00:45:41,604 INFO L280 TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID [2020-07-18 00:45:41,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID [2020-07-18 00:45:41,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID [2020-07-18 00:45:41,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {7908#true} assume true; {7908#true} is VALID [2020-07-18 00:45:41,605 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID [2020-07-18 00:45:41,605 INFO L263 TraceCheckUtils]: 9: Hoare triple {7908#true} call #t~ret21 := main(); {7908#true} is VALID [2020-07-18 00:45:41,606 INFO L280 TraceCheckUtils]: 10: Hoare triple {7908#true} ~q~0 := 0; {7908#true} is VALID [2020-07-18 00:45:41,606 INFO L280 TraceCheckUtils]: 11: Hoare triple {7908#true} havoc ~method_id~0; {7908#true} is VALID [2020-07-18 00:45:41,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID [2020-07-18 00:45:41,606 INFO L280 TraceCheckUtils]: 13: Hoare triple {7908#true} goto; {7908#true} is VALID [2020-07-18 00:45:41,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-18 00:45:41,607 INFO L280 TraceCheckUtils]: 15: Hoare triple {7908#true} assume 0 == ~q~0; {7908#true} is VALID [2020-07-18 00:45:41,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {7908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7908#true} is VALID [2020-07-18 00:45:41,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {7908#true} assume 0 != #t~nondet0; {7908#true} is VALID [2020-07-18 00:45:41,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {7908#true} havoc #t~nondet0; {7908#true} is VALID [2020-07-18 00:45:41,608 INFO L280 TraceCheckUtils]: 19: Hoare triple {7908#true} ~method_id~0 := 3; {7908#true} is VALID [2020-07-18 00:45:41,608 INFO L280 TraceCheckUtils]: 20: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-18 00:45:41,608 INFO L280 TraceCheckUtils]: 21: Hoare triple {7908#true} ~q~0 := 2; {7908#true} is VALID [2020-07-18 00:45:41,608 INFO L280 TraceCheckUtils]: 22: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID [2020-07-18 00:45:41,609 INFO L280 TraceCheckUtils]: 23: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-18 00:45:41,609 INFO L280 TraceCheckUtils]: 24: Hoare triple {7908#true} assume !(0 == ~q~0); {7908#true} is VALID [2020-07-18 00:45:41,609 INFO L280 TraceCheckUtils]: 25: Hoare triple {7908#true} assume !(1 == ~q~0); {7908#true} is VALID [2020-07-18 00:45:41,609 INFO L280 TraceCheckUtils]: 26: Hoare triple {7908#true} assume 2 == ~q~0; {7908#true} is VALID [2020-07-18 00:45:41,609 INFO L280 TraceCheckUtils]: 27: Hoare triple {7908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7908#true} is VALID [2020-07-18 00:45:41,610 INFO L280 TraceCheckUtils]: 28: Hoare triple {7908#true} assume 0 != #t~nondet4; {7908#true} is VALID [2020-07-18 00:45:41,610 INFO L280 TraceCheckUtils]: 29: Hoare triple {7908#true} havoc #t~nondet4; {7908#true} is VALID [2020-07-18 00:45:41,610 INFO L280 TraceCheckUtils]: 30: Hoare triple {7908#true} ~method_id~0 := 1; {7908#true} is VALID [2020-07-18 00:45:41,611 INFO L280 TraceCheckUtils]: 31: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-18 00:45:41,611 INFO L280 TraceCheckUtils]: 32: Hoare triple {7908#true} ~q~0 := 3; {7918#(<= 3 main_~q~0)} is VALID [2020-07-18 00:45:41,612 INFO L280 TraceCheckUtils]: 33: Hoare triple {7918#(<= 3 main_~q~0)} ~this_state~0 := 2; {7918#(<= 3 main_~q~0)} is VALID [2020-07-18 00:45:41,612 INFO L280 TraceCheckUtils]: 34: Hoare triple {7918#(<= 3 main_~q~0)} assume !false; {7918#(<= 3 main_~q~0)} is VALID [2020-07-18 00:45:41,612 INFO L280 TraceCheckUtils]: 35: Hoare triple {7918#(<= 3 main_~q~0)} assume !(0 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID [2020-07-18 00:45:41,613 INFO L280 TraceCheckUtils]: 36: Hoare triple {7918#(<= 3 main_~q~0)} assume !(1 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID [2020-07-18 00:45:41,613 INFO L280 TraceCheckUtils]: 37: Hoare triple {7918#(<= 3 main_~q~0)} assume 2 == ~q~0; {7909#false} is VALID [2020-07-18 00:45:41,614 INFO L280 TraceCheckUtils]: 38: Hoare triple {7909#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7909#false} is VALID [2020-07-18 00:45:41,614 INFO L280 TraceCheckUtils]: 39: Hoare triple {7909#false} assume !(0 != #t~nondet4); {7909#false} is VALID [2020-07-18 00:45:41,614 INFO L280 TraceCheckUtils]: 40: Hoare triple {7909#false} havoc #t~nondet4; {7909#false} is VALID [2020-07-18 00:45:41,614 INFO L280 TraceCheckUtils]: 41: Hoare triple {7909#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7909#false} is VALID [2020-07-18 00:45:41,614 INFO L280 TraceCheckUtils]: 42: Hoare triple {7909#false} assume !(0 != #t~nondet5); {7909#false} is VALID [2020-07-18 00:45:41,614 INFO L280 TraceCheckUtils]: 43: Hoare triple {7909#false} havoc #t~nondet5; {7909#false} is VALID [2020-07-18 00:45:41,615 INFO L280 TraceCheckUtils]: 44: Hoare triple {7909#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7909#false} is VALID [2020-07-18 00:45:41,615 INFO L280 TraceCheckUtils]: 45: Hoare triple {7909#false} assume 0 != #t~nondet6; {7909#false} is VALID [2020-07-18 00:45:41,615 INFO L280 TraceCheckUtils]: 46: Hoare triple {7909#false} havoc #t~nondet6; {7909#false} is VALID [2020-07-18 00:45:41,615 INFO L280 TraceCheckUtils]: 47: Hoare triple {7909#false} ~method_id~0 := 4; {7909#false} is VALID [2020-07-18 00:45:41,616 INFO L280 TraceCheckUtils]: 48: Hoare triple {7909#false} assume 2 == ~this_state~0; {7909#false} is VALID [2020-07-18 00:45:41,616 INFO L280 TraceCheckUtils]: 49: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2020-07-18 00:45:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:41,626 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:41,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531160704] [2020-07-18 00:45:41,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:41,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:41,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968334993] [2020-07-18 00:45:41,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-07-18 00:45:41,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:41,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:41,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:41,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:41,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:41,668 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 4 states. [2020-07-18 00:45:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:42,845 INFO L93 Difference]: Finished difference Result 301 states and 357 transitions. [2020-07-18 00:45:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:42,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-07-18 00:45:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2020-07-18 00:45:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2020-07-18 00:45:42,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 352 transitions. [2020-07-18 00:45:43,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:43,241 INFO L225 Difference]: With dead ends: 301 [2020-07-18 00:45:43,241 INFO L226 Difference]: Without dead ends: 158 [2020-07-18 00:45:43,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-18 00:45:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-18 00:45:43,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:43,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-18 00:45:43,799 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-18 00:45:43,799 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-18 00:45:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:43,803 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2020-07-18 00:45:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-18 00:45:43,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:43,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:43,804 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-18 00:45:43,804 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-18 00:45:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:43,808 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2020-07-18 00:45:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-18 00:45:43,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:43,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:43,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:43,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-18 00:45:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2020-07-18 00:45:43,813 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 50 [2020-07-18 00:45:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:43,814 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2020-07-18 00:45:43,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:43,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 184 transitions. [2020-07-18 00:45:44,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-18 00:45:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 00:45:44,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:44,093 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:44,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:45:44,093 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1459500481, now seen corresponding path program 1 times [2020-07-18 00:45:44,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:44,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537367374] [2020-07-18 00:45:44,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:44,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID [2020-07-18 00:45:44,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID [2020-07-18 00:45:44,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID [2020-07-18 00:45:44,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID [2020-07-18 00:45:44,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID [2020-07-18 00:45:44,167 INFO L280 TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID [2020-07-18 00:45:44,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {9159#true} assume true; {9159#true} is VALID [2020-07-18 00:45:44,167 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID [2020-07-18 00:45:44,169 INFO L263 TraceCheckUtils]: 0: Hoare triple {9159#true} call ULTIMATE.init(); {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:44,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID [2020-07-18 00:45:44,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID [2020-07-18 00:45:44,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID [2020-07-18 00:45:44,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID [2020-07-18 00:45:44,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID [2020-07-18 00:45:44,171 INFO L280 TraceCheckUtils]: 6: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID [2020-07-18 00:45:44,171 INFO L280 TraceCheckUtils]: 7: Hoare triple {9159#true} assume true; {9159#true} is VALID [2020-07-18 00:45:44,171 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID [2020-07-18 00:45:44,171 INFO L263 TraceCheckUtils]: 9: Hoare triple {9159#true} call #t~ret21 := main(); {9159#true} is VALID [2020-07-18 00:45:44,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {9159#true} ~q~0 := 0; {9159#true} is VALID [2020-07-18 00:45:44,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {9159#true} havoc ~method_id~0; {9159#true} is VALID [2020-07-18 00:45:44,172 INFO L280 TraceCheckUtils]: 12: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID [2020-07-18 00:45:44,172 INFO L280 TraceCheckUtils]: 13: Hoare triple {9159#true} goto; {9159#true} is VALID [2020-07-18 00:45:44,173 INFO L280 TraceCheckUtils]: 14: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-18 00:45:44,173 INFO L280 TraceCheckUtils]: 15: Hoare triple {9159#true} assume 0 == ~q~0; {9159#true} is VALID [2020-07-18 00:45:44,173 INFO L280 TraceCheckUtils]: 16: Hoare triple {9159#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9159#true} is VALID [2020-07-18 00:45:44,173 INFO L280 TraceCheckUtils]: 17: Hoare triple {9159#true} assume 0 != #t~nondet0; {9159#true} is VALID [2020-07-18 00:45:44,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {9159#true} havoc #t~nondet0; {9159#true} is VALID [2020-07-18 00:45:44,174 INFO L280 TraceCheckUtils]: 19: Hoare triple {9159#true} ~method_id~0 := 3; {9159#true} is VALID [2020-07-18 00:45:44,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-18 00:45:44,175 INFO L280 TraceCheckUtils]: 21: Hoare triple {9159#true} ~q~0 := 2; {9159#true} is VALID [2020-07-18 00:45:44,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID [2020-07-18 00:45:44,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-18 00:45:44,175 INFO L280 TraceCheckUtils]: 24: Hoare triple {9159#true} assume !(0 == ~q~0); {9159#true} is VALID [2020-07-18 00:45:44,176 INFO L280 TraceCheckUtils]: 25: Hoare triple {9159#true} assume !(1 == ~q~0); {9159#true} is VALID [2020-07-18 00:45:44,176 INFO L280 TraceCheckUtils]: 26: Hoare triple {9159#true} assume 2 == ~q~0; {9159#true} is VALID [2020-07-18 00:45:44,176 INFO L280 TraceCheckUtils]: 27: Hoare triple {9159#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9159#true} is VALID [2020-07-18 00:45:44,176 INFO L280 TraceCheckUtils]: 28: Hoare triple {9159#true} assume 0 != #t~nondet4; {9159#true} is VALID [2020-07-18 00:45:44,177 INFO L280 TraceCheckUtils]: 29: Hoare triple {9159#true} havoc #t~nondet4; {9159#true} is VALID [2020-07-18 00:45:44,177 INFO L280 TraceCheckUtils]: 30: Hoare triple {9159#true} ~method_id~0 := 1; {9159#true} is VALID [2020-07-18 00:45:44,177 INFO L280 TraceCheckUtils]: 31: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-18 00:45:44,177 INFO L280 TraceCheckUtils]: 32: Hoare triple {9159#true} ~q~0 := 3; {9159#true} is VALID [2020-07-18 00:45:44,179 INFO L280 TraceCheckUtils]: 33: Hoare triple {9159#true} ~this_state~0 := 2; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,180 INFO L280 TraceCheckUtils]: 34: Hoare triple {9169#(= 2 main_~this_state~0)} assume !false; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,180 INFO L280 TraceCheckUtils]: 35: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,181 INFO L280 TraceCheckUtils]: 36: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(1 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,183 INFO L280 TraceCheckUtils]: 37: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(2 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,183 INFO L280 TraceCheckUtils]: 38: Hoare triple {9169#(= 2 main_~this_state~0)} assume 3 == ~q~0; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,185 INFO L280 TraceCheckUtils]: 39: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,185 INFO L280 TraceCheckUtils]: 40: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet9); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,187 INFO L280 TraceCheckUtils]: 41: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet9; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,187 INFO L280 TraceCheckUtils]: 42: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,188 INFO L280 TraceCheckUtils]: 43: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet10); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,194 INFO L280 TraceCheckUtils]: 44: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet10; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,203 INFO L280 TraceCheckUtils]: 45: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,203 INFO L280 TraceCheckUtils]: 46: Hoare triple {9169#(= 2 main_~this_state~0)} assume 0 != #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,204 INFO L280 TraceCheckUtils]: 47: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,208 INFO L280 TraceCheckUtils]: 48: Hoare triple {9169#(= 2 main_~this_state~0)} ~method_id~0 := 4; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-18 00:45:44,210 INFO L280 TraceCheckUtils]: 49: Hoare triple {9169#(= 2 main_~this_state~0)} assume 2 != ~this_state~0; {9160#false} is VALID [2020-07-18 00:45:44,210 INFO L280 TraceCheckUtils]: 50: Hoare triple {9160#false} assume !false; {9160#false} is VALID [2020-07-18 00:45:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:44,215 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:44,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537367374] [2020-07-18 00:45:44,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:44,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:44,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660753982] [2020-07-18 00:45:44,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-18 00:45:44,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:44,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:44,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:44,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:44,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:44,270 INFO L87 Difference]: Start difference. First operand 158 states and 184 transitions. Second operand 4 states. [2020-07-18 00:45:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:46,107 INFO L93 Difference]: Finished difference Result 356 states and 426 transitions. [2020-07-18 00:45:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:46,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-18 00:45:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2020-07-18 00:45:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2020-07-18 00:45:46,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 421 transitions. [2020-07-18 00:45:46,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:46,633 INFO L225 Difference]: With dead ends: 356 [2020-07-18 00:45:46,633 INFO L226 Difference]: Without dead ends: 248 [2020-07-18 00:45:46,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-18 00:45:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 223. [2020-07-18 00:45:47,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:47,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 223 states. [2020-07-18 00:45:47,580 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 223 states. [2020-07-18 00:45:47,580 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 223 states. [2020-07-18 00:45:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:47,588 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2020-07-18 00:45:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2020-07-18 00:45:47,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:47,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:47,590 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 248 states. [2020-07-18 00:45:47,590 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 248 states. [2020-07-18 00:45:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:47,597 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2020-07-18 00:45:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2020-07-18 00:45:47,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:47,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:47,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:47,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-18 00:45:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2020-07-18 00:45:47,604 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 51 [2020-07-18 00:45:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:47,605 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2020-07-18 00:45:47,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:47,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 262 transitions. [2020-07-18 00:45:48,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2020-07-18 00:45:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:45:48,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:48,001 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:48,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:45:48,001 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -389028907, now seen corresponding path program 1 times [2020-07-18 00:45:48,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:48,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322747378] [2020-07-18 00:45:48,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:48,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID [2020-07-18 00:45:48,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID [2020-07-18 00:45:48,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID [2020-07-18 00:45:48,094 INFO L280 TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID [2020-07-18 00:45:48,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID [2020-07-18 00:45:48,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID [2020-07-18 00:45:48,095 INFO L280 TraceCheckUtils]: 6: Hoare triple {10830#true} assume true; {10830#true} is VALID [2020-07-18 00:45:48,095 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID [2020-07-18 00:45:48,097 INFO L263 TraceCheckUtils]: 0: Hoare triple {10830#true} call ULTIMATE.init(); {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:48,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID [2020-07-18 00:45:48,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID [2020-07-18 00:45:48,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID [2020-07-18 00:45:48,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID [2020-07-18 00:45:48,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID [2020-07-18 00:45:48,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID [2020-07-18 00:45:48,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {10830#true} assume true; {10830#true} is VALID [2020-07-18 00:45:48,099 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID [2020-07-18 00:45:48,099 INFO L263 TraceCheckUtils]: 9: Hoare triple {10830#true} call #t~ret21 := main(); {10830#true} is VALID [2020-07-18 00:45:48,099 INFO L280 TraceCheckUtils]: 10: Hoare triple {10830#true} ~q~0 := 0; {10830#true} is VALID [2020-07-18 00:45:48,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {10830#true} havoc ~method_id~0; {10830#true} is VALID [2020-07-18 00:45:48,100 INFO L280 TraceCheckUtils]: 12: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID [2020-07-18 00:45:48,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {10830#true} goto; {10830#true} is VALID [2020-07-18 00:45:48,100 INFO L280 TraceCheckUtils]: 14: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-18 00:45:48,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {10830#true} assume 0 == ~q~0; {10830#true} is VALID [2020-07-18 00:45:48,101 INFO L280 TraceCheckUtils]: 16: Hoare triple {10830#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10830#true} is VALID [2020-07-18 00:45:48,101 INFO L280 TraceCheckUtils]: 17: Hoare triple {10830#true} assume 0 != #t~nondet0; {10830#true} is VALID [2020-07-18 00:45:48,101 INFO L280 TraceCheckUtils]: 18: Hoare triple {10830#true} havoc #t~nondet0; {10830#true} is VALID [2020-07-18 00:45:48,102 INFO L280 TraceCheckUtils]: 19: Hoare triple {10830#true} ~method_id~0 := 3; {10830#true} is VALID [2020-07-18 00:45:48,102 INFO L280 TraceCheckUtils]: 20: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-18 00:45:48,102 INFO L280 TraceCheckUtils]: 21: Hoare triple {10830#true} ~q~0 := 2; {10830#true} is VALID [2020-07-18 00:45:48,102 INFO L280 TraceCheckUtils]: 22: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID [2020-07-18 00:45:48,102 INFO L280 TraceCheckUtils]: 23: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-18 00:45:48,108 INFO L280 TraceCheckUtils]: 24: Hoare triple {10830#true} assume !(0 == ~q~0); {10830#true} is VALID [2020-07-18 00:45:48,109 INFO L280 TraceCheckUtils]: 25: Hoare triple {10830#true} assume !(1 == ~q~0); {10830#true} is VALID [2020-07-18 00:45:48,109 INFO L280 TraceCheckUtils]: 26: Hoare triple {10830#true} assume 2 == ~q~0; {10830#true} is VALID [2020-07-18 00:45:48,109 INFO L280 TraceCheckUtils]: 27: Hoare triple {10830#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10830#true} is VALID [2020-07-18 00:45:48,112 INFO L280 TraceCheckUtils]: 28: Hoare triple {10830#true} assume 0 != #t~nondet4; {10830#true} is VALID [2020-07-18 00:45:48,113 INFO L280 TraceCheckUtils]: 29: Hoare triple {10830#true} havoc #t~nondet4; {10830#true} is VALID [2020-07-18 00:45:48,113 INFO L280 TraceCheckUtils]: 30: Hoare triple {10830#true} ~method_id~0 := 1; {10830#true} is VALID [2020-07-18 00:45:48,113 INFO L280 TraceCheckUtils]: 31: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-18 00:45:48,119 INFO L280 TraceCheckUtils]: 32: Hoare triple {10830#true} ~q~0 := 3; {10840#(= 3 main_~q~0)} is VALID [2020-07-18 00:45:48,120 INFO L280 TraceCheckUtils]: 33: Hoare triple {10840#(= 3 main_~q~0)} ~this_state~0 := 2; {10840#(= 3 main_~q~0)} is VALID [2020-07-18 00:45:48,121 INFO L280 TraceCheckUtils]: 34: Hoare triple {10840#(= 3 main_~q~0)} assume !false; {10840#(= 3 main_~q~0)} is VALID [2020-07-18 00:45:48,121 INFO L280 TraceCheckUtils]: 35: Hoare triple {10840#(= 3 main_~q~0)} assume !(0 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-18 00:45:48,122 INFO L280 TraceCheckUtils]: 36: Hoare triple {10840#(= 3 main_~q~0)} assume !(1 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-18 00:45:48,123 INFO L280 TraceCheckUtils]: 37: Hoare triple {10840#(= 3 main_~q~0)} assume !(2 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-18 00:45:48,123 INFO L280 TraceCheckUtils]: 38: Hoare triple {10840#(= 3 main_~q~0)} assume !(3 == ~q~0); {10831#false} is VALID [2020-07-18 00:45:48,124 INFO L280 TraceCheckUtils]: 39: Hoare triple {10831#false} assume 4 == ~q~0; {10831#false} is VALID [2020-07-18 00:45:48,124 INFO L280 TraceCheckUtils]: 40: Hoare triple {10831#false} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {10831#false} is VALID [2020-07-18 00:45:48,124 INFO L280 TraceCheckUtils]: 41: Hoare triple {10831#false} assume !(0 != #t~nondet15); {10831#false} is VALID [2020-07-18 00:45:48,124 INFO L280 TraceCheckUtils]: 42: Hoare triple {10831#false} havoc #t~nondet15; {10831#false} is VALID [2020-07-18 00:45:48,125 INFO L280 TraceCheckUtils]: 43: Hoare triple {10831#false} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {10831#false} is VALID [2020-07-18 00:45:48,125 INFO L280 TraceCheckUtils]: 44: Hoare triple {10831#false} assume !(0 != #t~nondet16); {10831#false} is VALID [2020-07-18 00:45:48,125 INFO L280 TraceCheckUtils]: 45: Hoare triple {10831#false} havoc #t~nondet16; {10831#false} is VALID [2020-07-18 00:45:48,126 INFO L280 TraceCheckUtils]: 46: Hoare triple {10831#false} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {10831#false} is VALID [2020-07-18 00:45:48,126 INFO L280 TraceCheckUtils]: 47: Hoare triple {10831#false} assume 0 != #t~nondet17; {10831#false} is VALID [2020-07-18 00:45:48,126 INFO L280 TraceCheckUtils]: 48: Hoare triple {10831#false} havoc #t~nondet17; {10831#false} is VALID [2020-07-18 00:45:48,126 INFO L280 TraceCheckUtils]: 49: Hoare triple {10831#false} ~method_id~0 := 4; {10831#false} is VALID [2020-07-18 00:45:48,126 INFO L280 TraceCheckUtils]: 50: Hoare triple {10831#false} assume 2 == ~this_state~0; {10831#false} is VALID [2020-07-18 00:45:48,127 INFO L280 TraceCheckUtils]: 51: Hoare triple {10831#false} assume !false; {10831#false} is VALID [2020-07-18 00:45:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:48,130 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:48,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322747378] [2020-07-18 00:45:48,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:48,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:48,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840938291] [2020-07-18 00:45:48,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-18 00:45:48,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:48,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:48,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:48,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:48,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:48,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:48,177 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 4 states. [2020-07-18 00:45:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:49,632 INFO L93 Difference]: Finished difference Result 369 states and 437 transitions. [2020-07-18 00:45:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:49,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-18 00:45:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2020-07-18 00:45:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2020-07-18 00:45:49,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 314 transitions. [2020-07-18 00:45:50,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:50,008 INFO L225 Difference]: With dead ends: 369 [2020-07-18 00:45:50,009 INFO L226 Difference]: Without dead ends: 199 [2020-07-18 00:45:50,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-07-18 00:45:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2020-07-18 00:45:50,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:50,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 197 states. [2020-07-18 00:45:50,802 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 197 states. [2020-07-18 00:45:50,802 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 197 states. [2020-07-18 00:45:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:50,807 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2020-07-18 00:45:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2020-07-18 00:45:50,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:50,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:50,809 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 199 states. [2020-07-18 00:45:50,809 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 199 states. [2020-07-18 00:45:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:50,814 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2020-07-18 00:45:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2020-07-18 00:45:50,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:50,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:50,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:50,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-07-18 00:45:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2020-07-18 00:45:50,821 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 52 [2020-07-18 00:45:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:50,822 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2020-07-18 00:45:50,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:50,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 197 states and 228 transitions. [2020-07-18 00:45:51,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2020-07-18 00:45:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 00:45:51,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:51,189 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:51,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:45:51,190 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash 910217494, now seen corresponding path program 1 times [2020-07-18 00:45:51,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:51,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900947633] [2020-07-18 00:45:51,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:51,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID [2020-07-18 00:45:51,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID [2020-07-18 00:45:51,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID [2020-07-18 00:45:51,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID [2020-07-18 00:45:51,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID [2020-07-18 00:45:51,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID [2020-07-18 00:45:51,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {12377#true} assume true; {12377#true} is VALID [2020-07-18 00:45:51,311 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID [2020-07-18 00:45:51,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {12377#true} call ULTIMATE.init(); {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:51,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID [2020-07-18 00:45:51,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID [2020-07-18 00:45:51,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID [2020-07-18 00:45:51,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID [2020-07-18 00:45:51,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID [2020-07-18 00:45:51,316 INFO L280 TraceCheckUtils]: 6: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID [2020-07-18 00:45:51,316 INFO L280 TraceCheckUtils]: 7: Hoare triple {12377#true} assume true; {12377#true} is VALID [2020-07-18 00:45:51,317 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID [2020-07-18 00:45:51,317 INFO L263 TraceCheckUtils]: 9: Hoare triple {12377#true} call #t~ret21 := main(); {12377#true} is VALID [2020-07-18 00:45:51,317 INFO L280 TraceCheckUtils]: 10: Hoare triple {12377#true} ~q~0 := 0; {12377#true} is VALID [2020-07-18 00:45:51,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {12377#true} havoc ~method_id~0; {12377#true} is VALID [2020-07-18 00:45:51,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID [2020-07-18 00:45:51,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {12377#true} goto; {12377#true} is VALID [2020-07-18 00:45:51,318 INFO L280 TraceCheckUtils]: 14: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-18 00:45:51,323 INFO L280 TraceCheckUtils]: 15: Hoare triple {12377#true} assume 0 == ~q~0; {12377#true} is VALID [2020-07-18 00:45:51,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {12377#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12377#true} is VALID [2020-07-18 00:45:51,324 INFO L280 TraceCheckUtils]: 17: Hoare triple {12377#true} assume 0 != #t~nondet0; {12377#true} is VALID [2020-07-18 00:45:51,324 INFO L280 TraceCheckUtils]: 18: Hoare triple {12377#true} havoc #t~nondet0; {12377#true} is VALID [2020-07-18 00:45:51,324 INFO L280 TraceCheckUtils]: 19: Hoare triple {12377#true} ~method_id~0 := 3; {12377#true} is VALID [2020-07-18 00:45:51,325 INFO L280 TraceCheckUtils]: 20: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-18 00:45:51,325 INFO L280 TraceCheckUtils]: 21: Hoare triple {12377#true} ~q~0 := 2; {12377#true} is VALID [2020-07-18 00:45:51,325 INFO L280 TraceCheckUtils]: 22: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID [2020-07-18 00:45:51,325 INFO L280 TraceCheckUtils]: 23: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-18 00:45:51,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {12377#true} assume !(0 == ~q~0); {12377#true} is VALID [2020-07-18 00:45:51,326 INFO L280 TraceCheckUtils]: 25: Hoare triple {12377#true} assume !(1 == ~q~0); {12377#true} is VALID [2020-07-18 00:45:51,326 INFO L280 TraceCheckUtils]: 26: Hoare triple {12377#true} assume 2 == ~q~0; {12377#true} is VALID [2020-07-18 00:45:51,326 INFO L280 TraceCheckUtils]: 27: Hoare triple {12377#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12377#true} is VALID [2020-07-18 00:45:51,326 INFO L280 TraceCheckUtils]: 28: Hoare triple {12377#true} assume !(0 != #t~nondet4); {12377#true} is VALID [2020-07-18 00:45:51,326 INFO L280 TraceCheckUtils]: 29: Hoare triple {12377#true} havoc #t~nondet4; {12377#true} is VALID [2020-07-18 00:45:51,327 INFO L280 TraceCheckUtils]: 30: Hoare triple {12377#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12377#true} is VALID [2020-07-18 00:45:51,327 INFO L280 TraceCheckUtils]: 31: Hoare triple {12377#true} assume 0 != #t~nondet5; {12377#true} is VALID [2020-07-18 00:45:51,327 INFO L280 TraceCheckUtils]: 32: Hoare triple {12377#true} havoc #t~nondet5; {12377#true} is VALID [2020-07-18 00:45:51,327 INFO L280 TraceCheckUtils]: 33: Hoare triple {12377#true} ~method_id~0 := 2; {12377#true} is VALID [2020-07-18 00:45:51,328 INFO L280 TraceCheckUtils]: 34: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-18 00:45:51,330 INFO L280 TraceCheckUtils]: 35: Hoare triple {12377#true} ~q~0 := 4; {12387#(<= 4 main_~q~0)} is VALID [2020-07-18 00:45:51,330 INFO L280 TraceCheckUtils]: 36: Hoare triple {12387#(<= 4 main_~q~0)} ~this_state~0 := 3; {12387#(<= 4 main_~q~0)} is VALID [2020-07-18 00:45:51,331 INFO L280 TraceCheckUtils]: 37: Hoare triple {12387#(<= 4 main_~q~0)} assume !false; {12387#(<= 4 main_~q~0)} is VALID [2020-07-18 00:45:51,331 INFO L280 TraceCheckUtils]: 38: Hoare triple {12387#(<= 4 main_~q~0)} assume !(0 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-18 00:45:51,332 INFO L280 TraceCheckUtils]: 39: Hoare triple {12387#(<= 4 main_~q~0)} assume !(1 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-18 00:45:51,333 INFO L280 TraceCheckUtils]: 40: Hoare triple {12387#(<= 4 main_~q~0)} assume !(2 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-18 00:45:51,333 INFO L280 TraceCheckUtils]: 41: Hoare triple {12387#(<= 4 main_~q~0)} assume 3 == ~q~0; {12378#false} is VALID [2020-07-18 00:45:51,334 INFO L280 TraceCheckUtils]: 42: Hoare triple {12378#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {12378#false} is VALID [2020-07-18 00:45:51,334 INFO L280 TraceCheckUtils]: 43: Hoare triple {12378#false} assume !(0 != #t~nondet9); {12378#false} is VALID [2020-07-18 00:45:51,334 INFO L280 TraceCheckUtils]: 44: Hoare triple {12378#false} havoc #t~nondet9; {12378#false} is VALID [2020-07-18 00:45:51,334 INFO L280 TraceCheckUtils]: 45: Hoare triple {12378#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {12378#false} is VALID [2020-07-18 00:45:51,335 INFO L280 TraceCheckUtils]: 46: Hoare triple {12378#false} assume !(0 != #t~nondet10); {12378#false} is VALID [2020-07-18 00:45:51,335 INFO L280 TraceCheckUtils]: 47: Hoare triple {12378#false} havoc #t~nondet10; {12378#false} is VALID [2020-07-18 00:45:51,335 INFO L280 TraceCheckUtils]: 48: Hoare triple {12378#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12378#false} is VALID [2020-07-18 00:45:51,335 INFO L280 TraceCheckUtils]: 49: Hoare triple {12378#false} assume 0 != #t~nondet11; {12378#false} is VALID [2020-07-18 00:45:51,336 INFO L280 TraceCheckUtils]: 50: Hoare triple {12378#false} havoc #t~nondet11; {12378#false} is VALID [2020-07-18 00:45:51,336 INFO L280 TraceCheckUtils]: 51: Hoare triple {12378#false} ~method_id~0 := 4; {12378#false} is VALID [2020-07-18 00:45:51,336 INFO L280 TraceCheckUtils]: 52: Hoare triple {12378#false} assume 2 != ~this_state~0; {12378#false} is VALID [2020-07-18 00:45:51,336 INFO L280 TraceCheckUtils]: 53: Hoare triple {12378#false} assume !false; {12378#false} is VALID [2020-07-18 00:45:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:51,343 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:51,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900947633] [2020-07-18 00:45:51,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:51,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:51,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272561980] [2020-07-18 00:45:51,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-18 00:45:51,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:51,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:51,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:51,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:51,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:51,401 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand 4 states. [2020-07-18 00:45:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:52,652 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2020-07-18 00:45:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:52,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-18 00:45:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2020-07-18 00:45:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2020-07-18 00:45:52,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 300 transitions. [2020-07-18 00:45:53,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:53,023 INFO L225 Difference]: With dead ends: 300 [2020-07-18 00:45:53,023 INFO L226 Difference]: Without dead ends: 156 [2020-07-18 00:45:53,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-18 00:45:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-07-18 00:45:53,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:53,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2020-07-18 00:45:53,738 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2020-07-18 00:45:53,739 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2020-07-18 00:45:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:53,746 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-07-18 00:45:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-18 00:45:53,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:53,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:53,747 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2020-07-18 00:45:53,748 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2020-07-18 00:45:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:53,753 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-07-18 00:45:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-18 00:45:53,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:53,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:53,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:53,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-18 00:45:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2020-07-18 00:45:53,759 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 54 [2020-07-18 00:45:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:53,759 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2020-07-18 00:45:53,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:53,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 175 transitions. [2020-07-18 00:45:54,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-18 00:45:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 00:45:54,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:54,022 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:54,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:45:54,022 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash 57784286, now seen corresponding path program 1 times [2020-07-18 00:45:54,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:54,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936977939] [2020-07-18 00:45:54,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:54,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID [2020-07-18 00:45:54,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID [2020-07-18 00:45:54,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID [2020-07-18 00:45:54,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID [2020-07-18 00:45:54,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID [2020-07-18 00:45:54,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID [2020-07-18 00:45:54,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {13618#true} assume true; {13618#true} is VALID [2020-07-18 00:45:54,131 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID [2020-07-18 00:45:54,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {13618#true} call ULTIMATE.init(); {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:54,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID [2020-07-18 00:45:54,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID [2020-07-18 00:45:54,133 INFO L280 TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID [2020-07-18 00:45:54,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID [2020-07-18 00:45:54,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID [2020-07-18 00:45:54,133 INFO L280 TraceCheckUtils]: 6: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID [2020-07-18 00:45:54,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {13618#true} assume true; {13618#true} is VALID [2020-07-18 00:45:54,134 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID [2020-07-18 00:45:54,134 INFO L263 TraceCheckUtils]: 9: Hoare triple {13618#true} call #t~ret21 := main(); {13618#true} is VALID [2020-07-18 00:45:54,134 INFO L280 TraceCheckUtils]: 10: Hoare triple {13618#true} ~q~0 := 0; {13618#true} is VALID [2020-07-18 00:45:54,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {13618#true} havoc ~method_id~0; {13618#true} is VALID [2020-07-18 00:45:54,135 INFO L280 TraceCheckUtils]: 12: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID [2020-07-18 00:45:54,135 INFO L280 TraceCheckUtils]: 13: Hoare triple {13618#true} goto; {13618#true} is VALID [2020-07-18 00:45:54,135 INFO L280 TraceCheckUtils]: 14: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-18 00:45:54,135 INFO L280 TraceCheckUtils]: 15: Hoare triple {13618#true} assume 0 == ~q~0; {13618#true} is VALID [2020-07-18 00:45:54,136 INFO L280 TraceCheckUtils]: 16: Hoare triple {13618#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13618#true} is VALID [2020-07-18 00:45:54,136 INFO L280 TraceCheckUtils]: 17: Hoare triple {13618#true} assume 0 != #t~nondet0; {13618#true} is VALID [2020-07-18 00:45:54,136 INFO L280 TraceCheckUtils]: 18: Hoare triple {13618#true} havoc #t~nondet0; {13618#true} is VALID [2020-07-18 00:45:54,136 INFO L280 TraceCheckUtils]: 19: Hoare triple {13618#true} ~method_id~0 := 3; {13618#true} is VALID [2020-07-18 00:45:54,137 INFO L280 TraceCheckUtils]: 20: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-18 00:45:54,137 INFO L280 TraceCheckUtils]: 21: Hoare triple {13618#true} ~q~0 := 2; {13618#true} is VALID [2020-07-18 00:45:54,137 INFO L280 TraceCheckUtils]: 22: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID [2020-07-18 00:45:54,137 INFO L280 TraceCheckUtils]: 23: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-18 00:45:54,138 INFO L280 TraceCheckUtils]: 24: Hoare triple {13618#true} assume !(0 == ~q~0); {13618#true} is VALID [2020-07-18 00:45:54,138 INFO L280 TraceCheckUtils]: 25: Hoare triple {13618#true} assume !(1 == ~q~0); {13618#true} is VALID [2020-07-18 00:45:54,138 INFO L280 TraceCheckUtils]: 26: Hoare triple {13618#true} assume 2 == ~q~0; {13618#true} is VALID [2020-07-18 00:45:54,138 INFO L280 TraceCheckUtils]: 27: Hoare triple {13618#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13618#true} is VALID [2020-07-18 00:45:54,138 INFO L280 TraceCheckUtils]: 28: Hoare triple {13618#true} assume !(0 != #t~nondet4); {13618#true} is VALID [2020-07-18 00:45:54,139 INFO L280 TraceCheckUtils]: 29: Hoare triple {13618#true} havoc #t~nondet4; {13618#true} is VALID [2020-07-18 00:45:54,139 INFO L280 TraceCheckUtils]: 30: Hoare triple {13618#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13618#true} is VALID [2020-07-18 00:45:54,139 INFO L280 TraceCheckUtils]: 31: Hoare triple {13618#true} assume 0 != #t~nondet5; {13618#true} is VALID [2020-07-18 00:45:54,139 INFO L280 TraceCheckUtils]: 32: Hoare triple {13618#true} havoc #t~nondet5; {13618#true} is VALID [2020-07-18 00:45:54,140 INFO L280 TraceCheckUtils]: 33: Hoare triple {13618#true} ~method_id~0 := 2; {13618#true} is VALID [2020-07-18 00:45:54,140 INFO L280 TraceCheckUtils]: 34: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-18 00:45:54,140 INFO L280 TraceCheckUtils]: 35: Hoare triple {13618#true} ~q~0 := 4; {13618#true} is VALID [2020-07-18 00:45:54,141 INFO L280 TraceCheckUtils]: 36: Hoare triple {13618#true} ~this_state~0 := 3; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,142 INFO L280 TraceCheckUtils]: 37: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !false; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,142 INFO L280 TraceCheckUtils]: 38: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,143 INFO L280 TraceCheckUtils]: 39: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(1 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,144 INFO L280 TraceCheckUtils]: 40: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(2 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,145 INFO L280 TraceCheckUtils]: 41: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(3 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,145 INFO L280 TraceCheckUtils]: 42: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 4 == ~q~0; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,146 INFO L280 TraceCheckUtils]: 43: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,147 INFO L280 TraceCheckUtils]: 44: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,148 INFO L280 TraceCheckUtils]: 45: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet15; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,149 INFO L280 TraceCheckUtils]: 46: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,149 INFO L280 TraceCheckUtils]: 47: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,150 INFO L280 TraceCheckUtils]: 48: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet16; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,151 INFO L280 TraceCheckUtils]: 49: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,152 INFO L280 TraceCheckUtils]: 50: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 0 != #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,152 INFO L280 TraceCheckUtils]: 51: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,153 INFO L280 TraceCheckUtils]: 52: Hoare triple {13628#(<= 3 main_~this_state~0)} ~method_id~0 := 4; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:54,154 INFO L280 TraceCheckUtils]: 53: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 2 == ~this_state~0; {13619#false} is VALID [2020-07-18 00:45:54,154 INFO L280 TraceCheckUtils]: 54: Hoare triple {13619#false} assume !false; {13619#false} is VALID [2020-07-18 00:45:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:54,161 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:54,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936977939] [2020-07-18 00:45:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:54,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872218511] [2020-07-18 00:45:54,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-07-18 00:45:54,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:54,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:54,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:54,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:54,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:54,216 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 4 states. [2020-07-18 00:45:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:55,448 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2020-07-18 00:45:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:55,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-07-18 00:45:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2020-07-18 00:45:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2020-07-18 00:45:55,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2020-07-18 00:45:55,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:55,707 INFO L225 Difference]: With dead ends: 158 [2020-07-18 00:45:55,707 INFO L226 Difference]: Without dead ends: 153 [2020-07-18 00:45:55,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-18 00:45:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-07-18 00:45:56,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:56,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 153 states. [2020-07-18 00:45:56,359 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-18 00:45:56,360 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-18 00:45:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:56,363 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-07-18 00:45:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-18 00:45:56,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:56,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:56,364 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-18 00:45:56,364 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-18 00:45:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:56,367 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-07-18 00:45:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-18 00:45:56,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:56,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:56,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:56,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-18 00:45:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2020-07-18 00:45:56,372 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 55 [2020-07-18 00:45:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:56,372 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2020-07-18 00:45:56,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:56,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions. [2020-07-18 00:45:56,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-18 00:45:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 00:45:56,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:45:56,654 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:45:56,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:45:56,654 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:45:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:45:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1987485698, now seen corresponding path program 1 times [2020-07-18 00:45:56,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:45:56,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [996330916] [2020-07-18 00:45:56,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:45:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:45:56,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID [2020-07-18 00:45:56,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID [2020-07-18 00:45:56,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID [2020-07-18 00:45:56,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID [2020-07-18 00:45:56,736 INFO L280 TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID [2020-07-18 00:45:56,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID [2020-07-18 00:45:56,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {14563#true} assume true; {14563#true} is VALID [2020-07-18 00:45:56,736 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID [2020-07-18 00:45:56,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {14563#true} call ULTIMATE.init(); {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-18 00:45:56,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID [2020-07-18 00:45:56,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID [2020-07-18 00:45:56,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID [2020-07-18 00:45:56,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID [2020-07-18 00:45:56,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID [2020-07-18 00:45:56,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID [2020-07-18 00:45:56,740 INFO L280 TraceCheckUtils]: 7: Hoare triple {14563#true} assume true; {14563#true} is VALID [2020-07-18 00:45:56,740 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID [2020-07-18 00:45:56,743 INFO L263 TraceCheckUtils]: 9: Hoare triple {14563#true} call #t~ret21 := main(); {14563#true} is VALID [2020-07-18 00:45:56,744 INFO L280 TraceCheckUtils]: 10: Hoare triple {14563#true} ~q~0 := 0; {14563#true} is VALID [2020-07-18 00:45:56,744 INFO L280 TraceCheckUtils]: 11: Hoare triple {14563#true} havoc ~method_id~0; {14563#true} is VALID [2020-07-18 00:45:56,744 INFO L280 TraceCheckUtils]: 12: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID [2020-07-18 00:45:56,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {14563#true} goto; {14563#true} is VALID [2020-07-18 00:45:56,744 INFO L280 TraceCheckUtils]: 14: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-18 00:45:56,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {14563#true} assume 0 == ~q~0; {14563#true} is VALID [2020-07-18 00:45:56,745 INFO L280 TraceCheckUtils]: 16: Hoare triple {14563#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14563#true} is VALID [2020-07-18 00:45:56,745 INFO L280 TraceCheckUtils]: 17: Hoare triple {14563#true} assume 0 != #t~nondet0; {14563#true} is VALID [2020-07-18 00:45:56,745 INFO L280 TraceCheckUtils]: 18: Hoare triple {14563#true} havoc #t~nondet0; {14563#true} is VALID [2020-07-18 00:45:56,746 INFO L280 TraceCheckUtils]: 19: Hoare triple {14563#true} ~method_id~0 := 3; {14563#true} is VALID [2020-07-18 00:45:56,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-18 00:45:56,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {14563#true} ~q~0 := 2; {14563#true} is VALID [2020-07-18 00:45:56,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID [2020-07-18 00:45:56,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-18 00:45:56,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {14563#true} assume !(0 == ~q~0); {14563#true} is VALID [2020-07-18 00:45:56,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {14563#true} assume !(1 == ~q~0); {14563#true} is VALID [2020-07-18 00:45:56,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {14563#true} assume 2 == ~q~0; {14563#true} is VALID [2020-07-18 00:45:56,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {14563#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14563#true} is VALID [2020-07-18 00:45:56,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {14563#true} assume !(0 != #t~nondet4); {14563#true} is VALID [2020-07-18 00:45:56,748 INFO L280 TraceCheckUtils]: 29: Hoare triple {14563#true} havoc #t~nondet4; {14563#true} is VALID [2020-07-18 00:45:56,748 INFO L280 TraceCheckUtils]: 30: Hoare triple {14563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14563#true} is VALID [2020-07-18 00:45:56,748 INFO L280 TraceCheckUtils]: 31: Hoare triple {14563#true} assume 0 != #t~nondet5; {14563#true} is VALID [2020-07-18 00:45:56,749 INFO L280 TraceCheckUtils]: 32: Hoare triple {14563#true} havoc #t~nondet5; {14563#true} is VALID [2020-07-18 00:45:56,749 INFO L280 TraceCheckUtils]: 33: Hoare triple {14563#true} ~method_id~0 := 2; {14563#true} is VALID [2020-07-18 00:45:56,749 INFO L280 TraceCheckUtils]: 34: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-18 00:45:56,749 INFO L280 TraceCheckUtils]: 35: Hoare triple {14563#true} ~q~0 := 4; {14563#true} is VALID [2020-07-18 00:45:56,750 INFO L280 TraceCheckUtils]: 36: Hoare triple {14563#true} ~this_state~0 := 3; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,751 INFO L280 TraceCheckUtils]: 37: Hoare triple {14573#(= 3 main_~this_state~0)} assume !false; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,751 INFO L280 TraceCheckUtils]: 38: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,752 INFO L280 TraceCheckUtils]: 39: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(1 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,752 INFO L280 TraceCheckUtils]: 40: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(2 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,753 INFO L280 TraceCheckUtils]: 41: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(3 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,754 INFO L280 TraceCheckUtils]: 42: Hoare triple {14573#(= 3 main_~this_state~0)} assume 4 == ~q~0; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,754 INFO L280 TraceCheckUtils]: 43: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,755 INFO L280 TraceCheckUtils]: 44: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,763 INFO L280 TraceCheckUtils]: 45: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet15; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,764 INFO L280 TraceCheckUtils]: 46: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,765 INFO L280 TraceCheckUtils]: 47: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,765 INFO L280 TraceCheckUtils]: 48: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet16; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,766 INFO L280 TraceCheckUtils]: 49: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,766 INFO L280 TraceCheckUtils]: 50: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet17); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,767 INFO L280 TraceCheckUtils]: 51: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet17; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,767 INFO L280 TraceCheckUtils]: 52: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,768 INFO L280 TraceCheckUtils]: 53: Hoare triple {14573#(= 3 main_~this_state~0)} assume 0 != #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,768 INFO L280 TraceCheckUtils]: 54: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,769 INFO L280 TraceCheckUtils]: 55: Hoare triple {14573#(= 3 main_~this_state~0)} ~method_id~0 := 5; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-18 00:45:56,769 INFO L280 TraceCheckUtils]: 56: Hoare triple {14573#(= 3 main_~this_state~0)} assume 3 != ~this_state~0; {14564#false} is VALID [2020-07-18 00:45:56,770 INFO L280 TraceCheckUtils]: 57: Hoare triple {14564#false} assume !false; {14564#false} is VALID [2020-07-18 00:45:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:45:56,773 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:45:56,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [996330916] [2020-07-18 00:45:56,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:45:56,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:45:56,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717444685] [2020-07-18 00:45:56,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-18 00:45:56,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:45:56,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:45:56,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:56,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:45:56,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:45:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:45:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:45:56,833 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 4 states. [2020-07-18 00:45:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:57,972 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2020-07-18 00:45:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:45:57,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-18 00:45:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:45:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2020-07-18 00:45:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:45:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2020-07-18 00:45:57,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2020-07-18 00:45:58,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:58,299 INFO L225 Difference]: With dead ends: 243 [2020-07-18 00:45:58,299 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:45:58,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:45:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:45:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:45:58,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:45:58,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:45:58,301 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:45:58,301 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:45:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:58,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:45:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:45:58,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:58,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:58,302 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:45:58,302 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:45:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:45:58,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:45:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:45:58,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:58,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:45:58,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:45:58,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:45:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:45:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:45:58,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2020-07-18 00:45:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:45:58,303 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:45:58,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:45:58,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:45:58,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:45:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:45:58,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:45:58,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:45:58,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:46:01,824 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:46:01,824 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 00:46:01,824 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|)) [2020-07-18 00:46:01,824 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:46:01,824 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-07-18 00:46:01,824 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 390) the Hoare annotation is: true [2020-07-18 00:46:01,825 INFO L264 CegarLoopResult]: At program point L366(lines 366 377) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L300(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L300-1(lines 300 315) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L234(lines 234 245) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L300-2(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L300-3(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L102(lines 102 113) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,826 INFO L264 CegarLoopResult]: At program point L334(lines 334 345) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,827 INFO L264 CegarLoopResult]: At program point L268(line 268) the Hoare annotation is: false [2020-07-18 00:46:01,827 INFO L264 CegarLoopResult]: At program point L202(lines 202 213) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,827 INFO L264 CegarLoopResult]: At program point L70(lines 70 72) the Hoare annotation is: false [2020-07-18 00:46:01,827 INFO L264 CegarLoopResult]: At program point L368(line 368) the Hoare annotation is: false [2020-07-18 00:46:01,827 INFO L264 CegarLoopResult]: At program point L302(lines 302 313) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,827 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 390) the Hoare annotation is: true [2020-07-18 00:46:01,827 INFO L264 CegarLoopResult]: At program point L170(lines 170 172) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L270(lines 270 272) the Hoare annotation is: false [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L138(lines 138 140) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L370(lines 370 372) the Hoare annotation is: false [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L238(lines 238 240) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L106(lines 106 108) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,828 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,829 INFO L264 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2020-07-18 00:46:01,829 INFO L264 CegarLoopResult]: At program point L338(lines 338 340) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,829 INFO L264 CegarLoopResult]: At program point L206(lines 206 208) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,829 INFO L271 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: true [2020-07-18 00:46:01,829 INFO L264 CegarLoopResult]: At program point L306(lines 306 308) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,829 INFO L271 CegarLoopResult]: At program point L174(line 174) the Hoare annotation is: true [2020-07-18 00:46:01,829 INFO L264 CegarLoopResult]: At program point L274(line 274) the Hoare annotation is: false [2020-07-18 00:46:01,829 INFO L271 CegarLoopResult]: At program point L142(line 142) the Hoare annotation is: true [2020-07-18 00:46:01,830 INFO L264 CegarLoopResult]: At program point L374(line 374) the Hoare annotation is: false [2020-07-18 00:46:01,830 INFO L271 CegarLoopResult]: At program point L242(line 242) the Hoare annotation is: true [2020-07-18 00:46:01,830 INFO L264 CegarLoopResult]: At program point L110(line 110) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,830 INFO L264 CegarLoopResult]: At program point L342(line 342) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,830 INFO L264 CegarLoopResult]: At program point L276(line 276) the Hoare annotation is: false [2020-07-18 00:46:01,830 INFO L264 CegarLoopResult]: At program point L210(line 210) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,830 INFO L264 CegarLoopResult]: At program point L376(line 376) the Hoare annotation is: false [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) the Hoare annotation is: false [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point L344(line 344) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (<= 4 main_~q~0) [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: false [2020-07-18 00:46:01,831 INFO L264 CegarLoopResult]: At program point L47(lines 47 98) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0))) [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L80-1(lines 80 95) the Hoare annotation is: false [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L80-2(line 80) the Hoare annotation is: false [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L80-3(line 80) the Hoare annotation is: false [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: false [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L48-1(lines 48 63) the Hoare annotation is: false [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: false [2020-07-18 00:46:01,832 INFO L264 CegarLoopResult]: At program point L48-3(line 48) the Hoare annotation is: false [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L148(line 148) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L148-1(lines 148 163) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L82(lines 82 93) the Hoare annotation is: false [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L148-2(line 148) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L148-3(line 148) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= 0 main_~q~0) [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L248(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,833 INFO L264 CegarLoopResult]: At program point L248-1(lines 248 263) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L248-2(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L248-3(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L116-1(lines 116 131) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L50(lines 50 61) the Hoare annotation is: false [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L116-2(line 116) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L116-3(line 116) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,834 INFO L264 CegarLoopResult]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and .cse0 (= 2 main_~q~0)))) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L348(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L348-1(lines 348 363) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L348-2(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L348-3(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L183(lines 183 282) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-18 00:46:01,835 INFO L264 CegarLoopResult]: At program point L216-1(lines 216 231) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L150(lines 150 161) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L216-2(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L216-3(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L316(line 316) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L283(lines 283 382) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L316-1(lines 316 331) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,836 INFO L264 CegarLoopResult]: At program point L250(lines 250 261) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L316-2(line 316) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L316-3(line 316) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L184-1(lines 184 199) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L118(lines 118 129) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L184-2(line 184) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L184-3(line 184) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,837 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= 0 main_~q~0) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L350(lines 350 361) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L284(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L284-1(lines 284 299) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L218(lines 218 229) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L284-2(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L284-3(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L86(lines 86 88) the Hoare annotation is: false [2020-07-18 00:46:01,838 INFO L264 CegarLoopResult]: At program point L318(lines 318 329) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L252(line 252) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L186(lines 186 197) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L54(lines 54 56) the Hoare annotation is: false [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L352(line 352) the Hoare annotation is: false [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L286(lines 286 297) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L154(lines 154 156) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (= 0 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (= 3 main_~this_state~0))) [2020-07-18 00:46:01,839 INFO L271 CegarLoopResult]: At program point L22-3(lines 22 385) the Hoare annotation is: true [2020-07-18 00:46:01,839 INFO L264 CegarLoopResult]: At program point L254(lines 254 256) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,840 INFO L264 CegarLoopResult]: At program point L122(lines 122 124) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,840 INFO L264 CegarLoopResult]: At program point L354(lines 354 356) the Hoare annotation is: false [2020-07-18 00:46:01,840 INFO L264 CegarLoopResult]: At program point L222(lines 222 224) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,840 INFO L271 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: true [2020-07-18 00:46:01,840 INFO L264 CegarLoopResult]: At program point L322(lines 322 324) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-18 00:46:01,840 INFO L264 CegarLoopResult]: At program point L190(lines 190 192) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,840 INFO L271 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: true [2020-07-18 00:46:01,840 INFO L264 CegarLoopResult]: At program point L290(lines 290 292) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,841 INFO L271 CegarLoopResult]: At program point L158(line 158) the Hoare annotation is: true [2020-07-18 00:46:01,841 INFO L264 CegarLoopResult]: At program point L258(line 258) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,841 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,841 INFO L264 CegarLoopResult]: At program point L27(lines 27 46) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and .cse0 (= 2 main_~q~0)))) [2020-07-18 00:46:01,841 INFO L264 CegarLoopResult]: At program point L358(line 358) the Hoare annotation is: false [2020-07-18 00:46:01,841 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,841 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L28-1(lines 28 43) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,842 INFO L271 CegarLoopResult]: At program point L326(line 326) the Hoare annotation is: true [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L194(line 194) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (<= 4 main_~q~0) [2020-07-18 00:46:01,842 INFO L264 CegarLoopResult]: At program point L360(line 360) the Hoare annotation is: false [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L294(line 294) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L228(line 228) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L30(lines 30 41) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,843 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L196(line 196) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: false [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L64-1(lines 64 79) the Hoare annotation is: false [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L64-2(line 64) the Hoare annotation is: false [2020-07-18 00:46:01,843 INFO L264 CegarLoopResult]: At program point L64-3(line 64) the Hoare annotation is: false [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L296(line 296) the Hoare annotation is: (and (= 3 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L164(line 164) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L164-1(lines 164 179) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L164-2(line 164) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L164-3(line 164) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L264(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L264-1(lines 264 279) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L264-2(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,844 INFO L264 CegarLoopResult]: At program point L264-3(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L132(line 132) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L99(lines 99 182) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0))) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L132-1(lines 132 147) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L66(lines 66 77) the Hoare annotation is: false [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L132-2(line 132) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L132-3(line 132) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L364(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,845 INFO L264 CegarLoopResult]: At program point L364-1(lines 364 379) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L364-2(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L364-3(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L232-1(lines 232 247) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L166(lines 166 177) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L232-2(line 232) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L232-3(line 232) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,846 INFO L264 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L100-1(lines 100 115) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L100-2(line 100) the Hoare annotation is: (= 2 main_~q~0) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L100-3(line 100) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L332(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L332-1(lines 332 347) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L266(lines 266 277) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,847 INFO L264 CegarLoopResult]: At program point L332-2(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,848 INFO L264 CegarLoopResult]: At program point L332-3(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-18 00:46:01,848 INFO L264 CegarLoopResult]: At program point L200(line 200) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,848 INFO L264 CegarLoopResult]: At program point L200-1(lines 200 215) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,848 INFO L264 CegarLoopResult]: At program point L134(lines 134 145) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-18 00:46:01,848 INFO L264 CegarLoopResult]: At program point L200-2(line 200) the Hoare annotation is: (= 3 main_~q~0) [2020-07-18 00:46:01,848 INFO L264 CegarLoopResult]: At program point L200-3(line 200) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-18 00:46:01,990 INFO L163 areAnnotationChecker]: CFG has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:46:02,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:46:02 BoogieIcfgContainer [2020-07-18 00:46:02,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:46:02,022 INFO L168 Benchmark]: Toolchain (without parser) took 38252.14 ms. Allocated memory was 148.4 MB in the beginning and 456.7 MB in the end (delta: 308.3 MB). Free memory was 106.2 MB in the beginning and 370.3 MB in the end (delta: -264.0 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:46:02,023 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 148.4 MB. Free memory was 125.0 MB in the beginning and 124.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:46:02,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.78 ms. Allocated memory was 148.4 MB in the beginning and 204.5 MB in the end (delta: 56.1 MB). Free memory was 105.8 MB in the beginning and 183.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:46:02,029 INFO L168 Benchmark]: Boogie Preprocessor took 56.34 ms. Allocated memory is still 204.5 MB. Free memory was 183.6 MB in the beginning and 180.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:46:02,029 INFO L168 Benchmark]: RCFGBuilder took 909.78 ms. Allocated memory is still 204.5 MB. Free memory was 180.7 MB in the beginning and 115.8 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:46:02,030 INFO L168 Benchmark]: TraceAbstraction took 36831.15 ms. Allocated memory was 204.5 MB in the beginning and 456.7 MB in the end (delta: 252.2 MB). Free memory was 115.2 MB in the beginning and 370.3 MB in the end (delta: -255.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:46:02,038 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 148.4 MB. Free memory was 125.0 MB in the beginning and 124.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 447.78 ms. Allocated memory was 148.4 MB in the beginning and 204.5 MB in the end (delta: 56.1 MB). Free memory was 105.8 MB in the beginning and 183.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.34 ms. Allocated memory is still 204.5 MB. Free memory was 183.6 MB in the beginning and 180.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.78 ms. Allocated memory is still 204.5 MB. Free memory was 180.7 MB in the beginning and 115.8 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36831.15 ms. Allocated memory was 204.5 MB in the beginning and 456.7 MB in the end (delta: 252.2 MB). Free memory was 115.2 MB in the beginning and 370.3 MB in the end (delta: -255.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 == q && this_state <= 0) || (3 == q && 2 == this_state)) || (4 <= q && 3 == this_state)) || (this_state <= 0 && 2 == q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (0 == q && this_state <= 0) || (4 <= q && 3 == this_state) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 191 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 33.0s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1996 SDtfs, 2887 SDslu, 123 SDs, 0 SdLazy, 1238 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 191 LocationsWithAnnotation, 191 PreInvPairs, 355 NumberOfFragments, 1069 HoareAnnotationTreeSize, 191 FomulaSimplifications, 3354 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 191 FomulaSimplificationsInter, 3787 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...