/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/gcd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:34:21,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:34:21,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:34:21,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:34:21,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:34:21,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:34:21,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:34:21,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:34:21,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:34:21,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:34:21,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:34:21,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:34:21,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:34:21,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:34:21,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:34:21,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:34:21,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:34:21,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:34:21,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:34:21,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:34:21,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:34:21,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:34:21,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:34:21,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:34:21,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:34:21,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:34:21,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:34:21,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:34:21,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:34:21,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:34:21,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:34:21,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:34:21,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:34:21,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:34:21,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:34:21,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:34:21,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:34:21,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:34:21,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:34:21,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:34:21,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:34:21,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:34:21,192 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:34:21,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:34:21,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:34:21,197 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:34:21,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:34:21,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:34:21,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:34:21,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:34:21,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:34:21,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:34:21,198 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:34:21,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:34:21,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:34:21,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:34:21,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:34:21,199 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:34:21,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:34:21,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:34:21,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:34:21,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:34:21,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:34:21,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:34:21,204 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:34:21,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:34:21,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:34:21,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:34:21,529 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:34:21,529 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:34:21,530 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-11 00:34:21,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01082a3b/410c021bc6664fc3810ca762240f7fcd/FLAG91458376b [2020-07-11 00:34:22,012 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:34:22,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-11 00:34:22,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01082a3b/410c021bc6664fc3810ca762240f7fcd/FLAG91458376b [2020-07-11 00:34:22,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01082a3b/410c021bc6664fc3810ca762240f7fcd [2020-07-11 00:34:22,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:34:22,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:34:22,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:34:22,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:34:22,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:34:22,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691d1e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22, skipping insertion in model container [2020-07-11 00:34:22,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:34:22,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:34:22,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:34:22,625 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:34:22,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:34:22,662 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:34:22,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22 WrapperNode [2020-07-11 00:34:22,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:34:22,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:34:22,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:34:22,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:34:22,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (1/1) ... [2020-07-11 00:34:22,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:34:22,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:34:22,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:34:22,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:34:22,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (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-11 00:34:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:34:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:34:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2020-07-11 00:34:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:34:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:34:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:34:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2020-07-11 00:34:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:34:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:34:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:34:23,236 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:34:23,237 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:34:23,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:34:23 BoogieIcfgContainer [2020-07-11 00:34:23,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:34:23,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:34:23,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:34:23,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:34:23,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:34:22" (1/3) ... [2020-07-11 00:34:23,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be42993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:34:23, skipping insertion in model container [2020-07-11 00:34:23,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:22" (2/3) ... [2020-07-11 00:34:23,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be42993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:34:23, skipping insertion in model container [2020-07-11 00:34:23,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:34:23" (3/3) ... [2020-07-11 00:34:23,260 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2020-07-11 00:34:23,268 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:34:23,275 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:34:23,288 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:34:23,312 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:34:23,312 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:34:23,312 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:34:23,312 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:34:23,312 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:34:23,313 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:34:23,313 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:34:23,313 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:34:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-11 00:34:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:34:23,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:23,344 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, 1] [2020-07-11 00:34:23,345 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1470222128, now seen corresponding path program 1 times [2020-07-11 00:34:23,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:23,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1574228721] [2020-07-11 00:34:23,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:23,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-11 00:34:23,616 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {46#true} {46#true} #64#return; {46#true} is VALID [2020-07-11 00:34:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:23,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~y1 := #in~y1; {58#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:23,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:23,726 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:23,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:23,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:23,732 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #68#return; {47#false} is VALID [2020-07-11 00:34:23,733 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2020-07-11 00:34:23,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-11 00:34:23,734 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #64#return; {46#true} is VALID [2020-07-11 00:34:23,734 INFO L263 TraceCheckUtils]: 3: Hoare triple {46#true} call #t~ret5 := main(); {46#true} is VALID [2020-07-11 00:34:23,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {46#true} is VALID [2020-07-11 00:34:23,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} ~m~0 := #t~nondet2; {46#true} is VALID [2020-07-11 00:34:23,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} havoc #t~nondet2; {46#true} is VALID [2020-07-11 00:34:23,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {50#(<= 1 main_~m~0)} is VALID [2020-07-11 00:34:23,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {50#(<= 1 main_~m~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {50#(<= 1 main_~m~0)} is VALID [2020-07-11 00:34:23,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {50#(<= 1 main_~m~0)} ~n~0 := #t~nondet3; {50#(<= 1 main_~m~0)} is VALID [2020-07-11 00:34:23,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(<= 1 main_~m~0)} havoc #t~nondet3; {50#(<= 1 main_~m~0)} is VALID [2020-07-11 00:34:23,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {50#(<= 1 main_~m~0)} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} is VALID [2020-07-11 00:34:23,745 INFO L263 TraceCheckUtils]: 12: Hoare triple {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} call #t~ret4 := gcd(~m~0, ~n~0); {46#true} is VALID [2020-07-11 00:34:23,746 INFO L280 TraceCheckUtils]: 13: Hoare triple {46#true} ~y1 := #in~y1; {58#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:23,748 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:23,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:23,750 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:23,751 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:23,754 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #68#return; {47#false} is VALID [2020-07-11 00:34:23,754 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {47#false} is VALID [2020-07-11 00:34:23,755 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~z~0 := #t~ret4; {47#false} is VALID [2020-07-11 00:34:23,755 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} havoc #t~ret4; {47#false} is VALID [2020-07-11 00:34:23,756 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {47#false} is VALID [2020-07-11 00:34:23,756 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-11 00:34:23,760 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-11 00:34:23,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1574228721] [2020-07-11 00:34:23,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:23,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:34:23,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158804883] [2020-07-11 00:34:23,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:34:23,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:23,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:23,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:23,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:23,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:23,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:23,840 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 7 states. [2020-07-11 00:34:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:24,347 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2020-07-11 00:34:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:34:24,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:34:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2020-07-11 00:34:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2020-07-11 00:34:24,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2020-07-11 00:34:24,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:24,483 INFO L225 Difference]: With dead ends: 60 [2020-07-11 00:34:24,483 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 00:34:24,487 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 00:34:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-11 00:34:24,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:24,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-11 00:34:24,593 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 00:34:24,594 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 00:34:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:24,601 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-11 00:34:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-11 00:34:24,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:24,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:24,603 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 00:34:24,603 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 00:34:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:24,612 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-11 00:34:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-11 00:34:24,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:24,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:24,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:24,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 00:34:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-11 00:34:24,627 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2020-07-11 00:34:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:24,629 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-11 00:34:24,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:24,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2020-07-11 00:34:24,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-11 00:34:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 00:34:24,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:24,695 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, 1, 1] [2020-07-11 00:34:24,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:34:24,696 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:24,697 INFO L82 PathProgramCache]: Analyzing trace with hash 831268307, now seen corresponding path program 1 times [2020-07-11 00:34:24,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:24,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685502519] [2020-07-11 00:34:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:24,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} assume true; {337#true} is VALID [2020-07-11 00:34:24,759 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {337#true} {337#true} #64#return; {337#true} is VALID [2020-07-11 00:34:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:24,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} ~y1 := #in~y1; {337#true} is VALID [2020-07-11 00:34:24,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} ~y2 := #in~y2; {337#true} is VALID [2020-07-11 00:34:24,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {337#true} assume !(~y1 <= 0 || ~y2 <= 0); {350#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:24,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {350#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {350#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:24,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {350#(<= 1 gcd_~y1)} #res := ~y1; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:24,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {351#(<= 1 |gcd_#res|)} assume true; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:24,808 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {351#(<= 1 |gcd_#res|)} {337#true} #68#return; {348#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:24,809 INFO L263 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2020-07-11 00:34:24,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} assume true; {337#true} is VALID [2020-07-11 00:34:24,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {337#true} {337#true} #64#return; {337#true} is VALID [2020-07-11 00:34:24,810 INFO L263 TraceCheckUtils]: 3: Hoare triple {337#true} call #t~ret5 := main(); {337#true} is VALID [2020-07-11 00:34:24,810 INFO L280 TraceCheckUtils]: 4: Hoare triple {337#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {337#true} is VALID [2020-07-11 00:34:24,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#true} ~m~0 := #t~nondet2; {337#true} is VALID [2020-07-11 00:34:24,811 INFO L280 TraceCheckUtils]: 6: Hoare triple {337#true} havoc #t~nondet2; {337#true} is VALID [2020-07-11 00:34:24,811 INFO L280 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {337#true} is VALID [2020-07-11 00:34:24,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {337#true} is VALID [2020-07-11 00:34:24,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {337#true} ~n~0 := #t~nondet3; {337#true} is VALID [2020-07-11 00:34:24,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#true} havoc #t~nondet3; {337#true} is VALID [2020-07-11 00:34:24,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {337#true} is VALID [2020-07-11 00:34:24,813 INFO L263 TraceCheckUtils]: 12: Hoare triple {337#true} call #t~ret4 := gcd(~m~0, ~n~0); {337#true} is VALID [2020-07-11 00:34:24,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {337#true} ~y1 := #in~y1; {337#true} is VALID [2020-07-11 00:34:24,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {337#true} ~y2 := #in~y2; {337#true} is VALID [2020-07-11 00:34:24,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {337#true} assume !(~y1 <= 0 || ~y2 <= 0); {350#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:24,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {350#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {350#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:24,816 INFO L280 TraceCheckUtils]: 17: Hoare triple {350#(<= 1 gcd_~y1)} #res := ~y1; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:24,817 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(<= 1 |gcd_#res|)} assume true; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:24,818 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {351#(<= 1 |gcd_#res|)} {337#true} #68#return; {348#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:24,819 INFO L280 TraceCheckUtils]: 20: Hoare triple {348#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {348#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:24,820 INFO L280 TraceCheckUtils]: 21: Hoare triple {348#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {349#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:24,821 INFO L280 TraceCheckUtils]: 22: Hoare triple {349#(<= 1 main_~z~0)} havoc #t~ret4; {349#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:24,821 INFO L280 TraceCheckUtils]: 23: Hoare triple {349#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {338#false} is VALID [2020-07-11 00:34:24,822 INFO L280 TraceCheckUtils]: 24: Hoare triple {338#false} assume !false; {338#false} is VALID [2020-07-11 00:34:24,823 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-11 00:34:24,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685502519] [2020-07-11 00:34:24,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:24,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:34:24,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807807369] [2020-07-11 00:34:24,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 00:34:24,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:24,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:34:24,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:24,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:34:24,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:24,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:34:24,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:24,856 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states. [2020-07-11 00:34:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:25,257 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-07-11 00:34:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:34:25,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 00:34:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-11 00:34:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-11 00:34:25,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-11 00:34:25,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:25,336 INFO L225 Difference]: With dead ends: 46 [2020-07-11 00:34:25,337 INFO L226 Difference]: Without dead ends: 40 [2020-07-11 00:34:25,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-11 00:34:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2020-07-11 00:34:25,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:25,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2020-07-11 00:34:25,397 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2020-07-11 00:34:25,397 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2020-07-11 00:34:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:25,402 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-11 00:34:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-11 00:34:25,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:25,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:25,404 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2020-07-11 00:34:25,404 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2020-07-11 00:34:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:25,408 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-11 00:34:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-11 00:34:25,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:25,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:25,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:25,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 00:34:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-11 00:34:25,416 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2020-07-11 00:34:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:25,416 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-11 00:34:25,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:34:25,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2020-07-11 00:34:25,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-11 00:34:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 00:34:25,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:25,488 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-11 00:34:25,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:34:25,489 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash -852904039, now seen corresponding path program 1 times [2020-07-11 00:34:25,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:25,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1248302128] [2020-07-11 00:34:25,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:25,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} assume true; {606#true} is VALID [2020-07-11 00:34:25,535 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {606#true} {606#true} #64#return; {606#true} is VALID [2020-07-11 00:34:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:25,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:25,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:25,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,699 INFO L280 TraceCheckUtils]: 4: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,702 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #62#return; {607#false} is VALID [2020-07-11 00:34:25,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} ~y1 := #in~y1; {606#true} is VALID [2020-07-11 00:34:25,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} ~y2 := #in~y2; {606#true} is VALID [2020-07-11 00:34:25,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {606#true} assume !(~y1 <= 0 || ~y2 <= 0); {627#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:25,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {627#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID [2020-07-11 00:34:25,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID [2020-07-11 00:34:25,706 INFO L263 TraceCheckUtils]: 5: Hoare triple {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {606#true} is VALID [2020-07-11 00:34:25,707 INFO L280 TraceCheckUtils]: 6: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:25,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {636#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:25,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,711 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #62#return; {607#false} is VALID [2020-07-11 00:34:25,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {607#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {607#false} is VALID [2020-07-11 00:34:25,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#false} #res := #t~ret1; {607#false} is VALID [2020-07-11 00:34:25,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {607#false} havoc #t~ret1; {607#false} is VALID [2020-07-11 00:34:25,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {607#false} assume true; {607#false} is VALID [2020-07-11 00:34:25,713 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {607#false} {606#true} #68#return; {607#false} is VALID [2020-07-11 00:34:25,714 INFO L263 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID [2020-07-11 00:34:25,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} assume true; {606#true} is VALID [2020-07-11 00:34:25,715 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {606#true} {606#true} #64#return; {606#true} is VALID [2020-07-11 00:34:25,715 INFO L263 TraceCheckUtils]: 3: Hoare triple {606#true} call #t~ret5 := main(); {606#true} is VALID [2020-07-11 00:34:25,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {606#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {606#true} is VALID [2020-07-11 00:34:25,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {606#true} ~m~0 := #t~nondet2; {606#true} is VALID [2020-07-11 00:34:25,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {606#true} havoc #t~nondet2; {606#true} is VALID [2020-07-11 00:34:25,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {606#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {606#true} is VALID [2020-07-11 00:34:25,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {606#true} is VALID [2020-07-11 00:34:25,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#true} ~n~0 := #t~nondet3; {606#true} is VALID [2020-07-11 00:34:25,717 INFO L280 TraceCheckUtils]: 10: Hoare triple {606#true} havoc #t~nondet3; {606#true} is VALID [2020-07-11 00:34:25,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {606#true} is VALID [2020-07-11 00:34:25,717 INFO L263 TraceCheckUtils]: 12: Hoare triple {606#true} call #t~ret4 := gcd(~m~0, ~n~0); {606#true} is VALID [2020-07-11 00:34:25,718 INFO L280 TraceCheckUtils]: 13: Hoare triple {606#true} ~y1 := #in~y1; {606#true} is VALID [2020-07-11 00:34:25,718 INFO L280 TraceCheckUtils]: 14: Hoare triple {606#true} ~y2 := #in~y2; {606#true} is VALID [2020-07-11 00:34:25,719 INFO L280 TraceCheckUtils]: 15: Hoare triple {606#true} assume !(~y1 <= 0 || ~y2 <= 0); {627#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:25,720 INFO L280 TraceCheckUtils]: 16: Hoare triple {627#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID [2020-07-11 00:34:25,721 INFO L280 TraceCheckUtils]: 17: Hoare triple {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID [2020-07-11 00:34:25,721 INFO L263 TraceCheckUtils]: 18: Hoare triple {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {606#true} is VALID [2020-07-11 00:34:25,722 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:25,722 INFO L280 TraceCheckUtils]: 20: Hoare triple {636#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:25,723 INFO L280 TraceCheckUtils]: 21: Hoare triple {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,724 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,724 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:25,726 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #62#return; {607#false} is VALID [2020-07-11 00:34:25,726 INFO L280 TraceCheckUtils]: 25: Hoare triple {607#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {607#false} is VALID [2020-07-11 00:34:25,727 INFO L280 TraceCheckUtils]: 26: Hoare triple {607#false} #res := #t~ret1; {607#false} is VALID [2020-07-11 00:34:25,727 INFO L280 TraceCheckUtils]: 27: Hoare triple {607#false} havoc #t~ret1; {607#false} is VALID [2020-07-11 00:34:25,727 INFO L280 TraceCheckUtils]: 28: Hoare triple {607#false} assume true; {607#false} is VALID [2020-07-11 00:34:25,727 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {607#false} {606#true} #68#return; {607#false} is VALID [2020-07-11 00:34:25,728 INFO L280 TraceCheckUtils]: 30: Hoare triple {607#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {607#false} is VALID [2020-07-11 00:34:25,728 INFO L280 TraceCheckUtils]: 31: Hoare triple {607#false} ~z~0 := #t~ret4; {607#false} is VALID [2020-07-11 00:34:25,728 INFO L280 TraceCheckUtils]: 32: Hoare triple {607#false} havoc #t~ret4; {607#false} is VALID [2020-07-11 00:34:25,729 INFO L280 TraceCheckUtils]: 33: Hoare triple {607#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {607#false} is VALID [2020-07-11 00:34:25,729 INFO L280 TraceCheckUtils]: 34: Hoare triple {607#false} assume !false; {607#false} is VALID [2020-07-11 00:34:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 00:34:25,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1248302128] [2020-07-11 00:34:25,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:25,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 00:34:25,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490996895] [2020-07-11 00:34:25,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-11 00:34:25,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:25,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:34:25,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:25,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:34:25,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:34:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:25,773 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2020-07-11 00:34:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:26,244 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-11 00:34:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:34:26,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-11 00:34:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2020-07-11 00:34:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2020-07-11 00:34:26,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2020-07-11 00:34:26,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:26,342 INFO L225 Difference]: With dead ends: 56 [2020-07-11 00:34:26,342 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 00:34:26,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:34:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 00:34:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-11 00:34:26,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:26,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-11 00:34:26,413 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-11 00:34:26,413 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-11 00:34:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:26,418 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-11 00:34:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-11 00:34:26,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:26,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:26,419 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-11 00:34:26,419 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-11 00:34:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:26,422 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-11 00:34:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-11 00:34:26,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:26,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:26,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:26,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-11 00:34:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-07-11 00:34:26,426 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 35 [2020-07-11 00:34:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:26,427 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-07-11 00:34:26,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:34:26,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 45 transitions. [2020-07-11 00:34:26,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-11 00:34:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 00:34:26,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:26,508 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-11 00:34:26,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:34:26,508 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:26,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2030561919, now seen corresponding path program 1 times [2020-07-11 00:34:26,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:26,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994507065] [2020-07-11 00:34:26,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:26,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} assume true; {925#true} is VALID [2020-07-11 00:34:26,580 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {925#true} {925#true} #64#return; {925#true} is VALID [2020-07-11 00:34:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:26,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:26,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:26,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,682 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #60#return; {926#false} is VALID [2020-07-11 00:34:26,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} ~y1 := #in~y1; {925#true} is VALID [2020-07-11 00:34:26,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {925#true} ~y2 := #in~y2; {925#true} is VALID [2020-07-11 00:34:26,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {925#true} assume !(~y1 <= 0 || ~y2 <= 0); {946#(<= 1 gcd_~y2)} is VALID [2020-07-11 00:34:26,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {946#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {946#(<= 1 gcd_~y2)} is VALID [2020-07-11 00:34:26,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {946#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID [2020-07-11 00:34:26,685 INFO L263 TraceCheckUtils]: 5: Hoare triple {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {925#true} is VALID [2020-07-11 00:34:26,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:26,687 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:26,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,688 INFO L280 TraceCheckUtils]: 9: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,690 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #60#return; {926#false} is VALID [2020-07-11 00:34:26,691 INFO L280 TraceCheckUtils]: 12: Hoare triple {926#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {926#false} is VALID [2020-07-11 00:34:26,691 INFO L280 TraceCheckUtils]: 13: Hoare triple {926#false} #res := #t~ret0; {926#false} is VALID [2020-07-11 00:34:26,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {926#false} havoc #t~ret0; {926#false} is VALID [2020-07-11 00:34:26,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {926#false} assume true; {926#false} is VALID [2020-07-11 00:34:26,692 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {926#false} {925#true} #68#return; {926#false} is VALID [2020-07-11 00:34:26,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2020-07-11 00:34:26,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID [2020-07-11 00:34:26,693 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #64#return; {925#true} is VALID [2020-07-11 00:34:26,694 INFO L263 TraceCheckUtils]: 3: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2020-07-11 00:34:26,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {925#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {925#true} is VALID [2020-07-11 00:34:26,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {925#true} ~m~0 := #t~nondet2; {925#true} is VALID [2020-07-11 00:34:26,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {925#true} havoc #t~nondet2; {925#true} is VALID [2020-07-11 00:34:26,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {925#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {925#true} is VALID [2020-07-11 00:34:26,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {925#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {925#true} is VALID [2020-07-11 00:34:26,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {925#true} ~n~0 := #t~nondet3; {925#true} is VALID [2020-07-11 00:34:26,695 INFO L280 TraceCheckUtils]: 10: Hoare triple {925#true} havoc #t~nondet3; {925#true} is VALID [2020-07-11 00:34:26,696 INFO L280 TraceCheckUtils]: 11: Hoare triple {925#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {925#true} is VALID [2020-07-11 00:34:26,696 INFO L263 TraceCheckUtils]: 12: Hoare triple {925#true} call #t~ret4 := gcd(~m~0, ~n~0); {925#true} is VALID [2020-07-11 00:34:26,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {925#true} ~y1 := #in~y1; {925#true} is VALID [2020-07-11 00:34:26,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {925#true} ~y2 := #in~y2; {925#true} is VALID [2020-07-11 00:34:26,699 INFO L280 TraceCheckUtils]: 15: Hoare triple {925#true} assume !(~y1 <= 0 || ~y2 <= 0); {946#(<= 1 gcd_~y2)} is VALID [2020-07-11 00:34:26,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {946#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {946#(<= 1 gcd_~y2)} is VALID [2020-07-11 00:34:26,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {946#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID [2020-07-11 00:34:26,704 INFO L263 TraceCheckUtils]: 18: Hoare triple {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {925#true} is VALID [2020-07-11 00:34:26,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-11 00:34:26,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {954#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-11 00:34:26,708 INFO L280 TraceCheckUtils]: 21: Hoare triple {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,709 INFO L280 TraceCheckUtils]: 22: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,709 INFO L280 TraceCheckUtils]: 23: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-11 00:34:26,710 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #60#return; {926#false} is VALID [2020-07-11 00:34:26,710 INFO L280 TraceCheckUtils]: 25: Hoare triple {926#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {926#false} is VALID [2020-07-11 00:34:26,711 INFO L280 TraceCheckUtils]: 26: Hoare triple {926#false} #res := #t~ret0; {926#false} is VALID [2020-07-11 00:34:26,711 INFO L280 TraceCheckUtils]: 27: Hoare triple {926#false} havoc #t~ret0; {926#false} is VALID [2020-07-11 00:34:26,711 INFO L280 TraceCheckUtils]: 28: Hoare triple {926#false} assume true; {926#false} is VALID [2020-07-11 00:34:26,711 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {926#false} {925#true} #68#return; {926#false} is VALID [2020-07-11 00:34:26,711 INFO L280 TraceCheckUtils]: 30: Hoare triple {926#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {926#false} is VALID [2020-07-11 00:34:26,711 INFO L280 TraceCheckUtils]: 31: Hoare triple {926#false} ~z~0 := #t~ret4; {926#false} is VALID [2020-07-11 00:34:26,712 INFO L280 TraceCheckUtils]: 32: Hoare triple {926#false} havoc #t~ret4; {926#false} is VALID [2020-07-11 00:34:26,712 INFO L280 TraceCheckUtils]: 33: Hoare triple {926#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {926#false} is VALID [2020-07-11 00:34:26,712 INFO L280 TraceCheckUtils]: 34: Hoare triple {926#false} assume !false; {926#false} is VALID [2020-07-11 00:34:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 00:34:26,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994507065] [2020-07-11 00:34:26,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:26,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:34:26,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341655382] [2020-07-11 00:34:26,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-11 00:34:26,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:26,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:26,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:26,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:26,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:26,766 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2020-07-11 00:34:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:27,153 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-11 00:34:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:34:27,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-11 00:34:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2020-07-11 00:34:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2020-07-11 00:34:27,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2020-07-11 00:34:27,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:27,242 INFO L225 Difference]: With dead ends: 56 [2020-07-11 00:34:27,242 INFO L226 Difference]: Without dead ends: 39 [2020-07-11 00:34:27,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-11 00:34:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-11 00:34:27,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:27,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-11 00:34:27,326 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-11 00:34:27,326 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-11 00:34:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:27,330 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-11 00:34:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-11 00:34:27,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:27,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:27,331 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-11 00:34:27,331 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-11 00:34:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:27,334 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-11 00:34:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-11 00:34:27,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:27,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:27,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:27,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 00:34:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-11 00:34:27,337 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 35 [2020-07-11 00:34:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:27,338 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-11 00:34:27,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:27,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-11 00:34:27,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-11 00:34:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 00:34:27,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:27,411 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-11 00:34:27,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:34:27,411 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2122258312, now seen corresponding path program 1 times [2020-07-11 00:34:27,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:27,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263902591] [2020-07-11 00:34:27,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:27,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} assume true; {1229#true} is VALID [2020-07-11 00:34:27,457 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1229#true} {1229#true} #64#return; {1229#true} is VALID [2020-07-11 00:34:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:27,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-11 00:34:27,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-11 00:34:27,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,563 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1253#(<= 1 gcd_~y1)} #62#return; {1261#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:27,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-11 00:34:27,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-11 00:34:27,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,566 INFO L280 TraceCheckUtils]: 3: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,568 INFO L263 TraceCheckUtils]: 5: Hoare triple {1253#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1229#true} is VALID [2020-07-11 00:34:27,569 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-11 00:34:27,569 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-11 00:34:27,570 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,571 INFO L280 TraceCheckUtils]: 9: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,579 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1253#(<= 1 gcd_~y1)} #62#return; {1261#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:27,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1261#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:27,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,582 INFO L280 TraceCheckUtils]: 15: Hoare triple {1262#(<= 1 |gcd_#res|)} havoc #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,582 INFO L280 TraceCheckUtils]: 16: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,583 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1229#true} #68#return; {1251#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:27,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {1229#true} call ULTIMATE.init(); {1229#true} is VALID [2020-07-11 00:34:27,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} assume true; {1229#true} is VALID [2020-07-11 00:34:27,585 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1229#true} {1229#true} #64#return; {1229#true} is VALID [2020-07-11 00:34:27,585 INFO L263 TraceCheckUtils]: 3: Hoare triple {1229#true} call #t~ret5 := main(); {1229#true} is VALID [2020-07-11 00:34:27,586 INFO L280 TraceCheckUtils]: 4: Hoare triple {1229#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1229#true} is VALID [2020-07-11 00:34:27,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {1229#true} ~m~0 := #t~nondet2; {1229#true} is VALID [2020-07-11 00:34:27,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#true} havoc #t~nondet2; {1229#true} is VALID [2020-07-11 00:34:27,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1229#true} is VALID [2020-07-11 00:34:27,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1229#true} is VALID [2020-07-11 00:34:27,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {1229#true} ~n~0 := #t~nondet3; {1229#true} is VALID [2020-07-11 00:34:27,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {1229#true} havoc #t~nondet3; {1229#true} is VALID [2020-07-11 00:34:27,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1229#true} is VALID [2020-07-11 00:34:27,588 INFO L263 TraceCheckUtils]: 12: Hoare triple {1229#true} call #t~ret4 := gcd(~m~0, ~n~0); {1229#true} is VALID [2020-07-11 00:34:27,588 INFO L280 TraceCheckUtils]: 13: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-11 00:34:27,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-11 00:34:27,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,590 INFO L280 TraceCheckUtils]: 16: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,591 INFO L280 TraceCheckUtils]: 17: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,592 INFO L263 TraceCheckUtils]: 18: Hoare triple {1253#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1229#true} is VALID [2020-07-11 00:34:27,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-11 00:34:27,592 INFO L280 TraceCheckUtils]: 20: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-11 00:34:27,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,595 INFO L280 TraceCheckUtils]: 22: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:27,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,596 INFO L280 TraceCheckUtils]: 24: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,598 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1253#(<= 1 gcd_~y1)} #62#return; {1261#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:27,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1261#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:27,600 INFO L280 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,600 INFO L280 TraceCheckUtils]: 28: Hoare triple {1262#(<= 1 |gcd_#res|)} havoc #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,601 INFO L280 TraceCheckUtils]: 29: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:27,603 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1229#true} #68#return; {1251#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:27,604 INFO L280 TraceCheckUtils]: 31: Hoare triple {1251#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1251#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:27,604 INFO L280 TraceCheckUtils]: 32: Hoare triple {1251#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1252#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:27,605 INFO L280 TraceCheckUtils]: 33: Hoare triple {1252#(<= 1 main_~z~0)} havoc #t~ret4; {1252#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:27,606 INFO L280 TraceCheckUtils]: 34: Hoare triple {1252#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {1230#false} is VALID [2020-07-11 00:34:27,606 INFO L280 TraceCheckUtils]: 35: Hoare triple {1230#false} assume !false; {1230#false} is VALID [2020-07-11 00:34:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-11 00:34:27,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263902591] [2020-07-11 00:34:27,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:27,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:34:27,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604077241] [2020-07-11 00:34:27,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 00:34:27,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:27,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:27,654 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-11 00:34:27,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:27,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:27,656 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-07-11 00:34:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:28,017 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-11 00:34:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:34:28,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 00:34:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:34:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:34:28,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-11 00:34:28,076 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-11 00:34:28,078 INFO L225 Difference]: With dead ends: 48 [2020-07-11 00:34:28,078 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 00:34:28,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:34:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 00:34:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-11 00:34:28,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:28,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-11 00:34:28,156 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-11 00:34:28,156 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-11 00:34:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:28,160 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-11 00:34:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-11 00:34:28,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:28,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:28,161 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-11 00:34:28,161 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-11 00:34:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:28,164 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-11 00:34:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-11 00:34:28,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:28,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:28,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:28,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-11 00:34:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-11 00:34:28,167 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 36 [2020-07-11 00:34:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:28,168 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-11 00:34:28,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:28,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2020-07-11 00:34:28,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-11 00:34:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 00:34:28,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:28,233 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-11 00:34:28,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:34:28,233 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 404002040, now seen corresponding path program 1 times [2020-07-11 00:34:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:28,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706133865] [2020-07-11 00:34:28,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:28,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-11 00:34:28,322 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1533#true} {1533#true} #64#return; {1533#true} is VALID [2020-07-11 00:34:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:28,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-11 00:34:28,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-11 00:34:28,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:28,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:28,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,376 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:28,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-11 00:34:28,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-11 00:34:28,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1533#true} is VALID [2020-07-11 00:34:28,377 INFO L280 TraceCheckUtils]: 3: Hoare triple {1533#true} assume !(~y1 == ~y2); {1533#true} is VALID [2020-07-11 00:34:28,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume ~y1 > ~y2; {1533#true} is VALID [2020-07-11 00:34:28,377 INFO L263 TraceCheckUtils]: 5: Hoare triple {1533#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1533#true} is VALID [2020-07-11 00:34:28,378 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-11 00:34:28,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-11 00:34:28,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:28,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:28,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,381 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:28,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:28,382 INFO L280 TraceCheckUtils]: 14: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {1565#(<= 1 |gcd_#res|)} havoc #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,384 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #68#return; {1555#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:28,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {1533#true} call ULTIMATE.init(); {1533#true} is VALID [2020-07-11 00:34:28,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-11 00:34:28,385 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1533#true} {1533#true} #64#return; {1533#true} is VALID [2020-07-11 00:34:28,385 INFO L263 TraceCheckUtils]: 3: Hoare triple {1533#true} call #t~ret5 := main(); {1533#true} is VALID [2020-07-11 00:34:28,385 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1533#true} is VALID [2020-07-11 00:34:28,385 INFO L280 TraceCheckUtils]: 5: Hoare triple {1533#true} ~m~0 := #t~nondet2; {1533#true} is VALID [2020-07-11 00:34:28,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} havoc #t~nondet2; {1533#true} is VALID [2020-07-11 00:34:28,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1533#true} is VALID [2020-07-11 00:34:28,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1533#true} is VALID [2020-07-11 00:34:28,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {1533#true} ~n~0 := #t~nondet3; {1533#true} is VALID [2020-07-11 00:34:28,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {1533#true} havoc #t~nondet3; {1533#true} is VALID [2020-07-11 00:34:28,386 INFO L280 TraceCheckUtils]: 11: Hoare triple {1533#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1533#true} is VALID [2020-07-11 00:34:28,386 INFO L263 TraceCheckUtils]: 12: Hoare triple {1533#true} call #t~ret4 := gcd(~m~0, ~n~0); {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L280 TraceCheckUtils]: 14: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L280 TraceCheckUtils]: 15: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L280 TraceCheckUtils]: 16: Hoare triple {1533#true} assume !(~y1 == ~y2); {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L280 TraceCheckUtils]: 17: Hoare triple {1533#true} assume ~y1 > ~y2; {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L263 TraceCheckUtils]: 18: Hoare triple {1533#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1533#true} is VALID [2020-07-11 00:34:28,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-11 00:34:28,388 INFO L280 TraceCheckUtils]: 20: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-11 00:34:28,388 INFO L280 TraceCheckUtils]: 21: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:28,389 INFO L280 TraceCheckUtils]: 22: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:28,389 INFO L280 TraceCheckUtils]: 23: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,389 INFO L280 TraceCheckUtils]: 24: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,390 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:28,391 INFO L280 TraceCheckUtils]: 26: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:28,391 INFO L280 TraceCheckUtils]: 27: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,392 INFO L280 TraceCheckUtils]: 28: Hoare triple {1565#(<= 1 |gcd_#res|)} havoc #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,392 INFO L280 TraceCheckUtils]: 29: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:28,393 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #68#return; {1555#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:28,393 INFO L280 TraceCheckUtils]: 31: Hoare triple {1555#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1555#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:28,394 INFO L280 TraceCheckUtils]: 32: Hoare triple {1555#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1556#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:28,395 INFO L280 TraceCheckUtils]: 33: Hoare triple {1556#(<= 1 main_~z~0)} havoc #t~ret4; {1556#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:28,395 INFO L280 TraceCheckUtils]: 34: Hoare triple {1556#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {1534#false} is VALID [2020-07-11 00:34:28,396 INFO L280 TraceCheckUtils]: 35: Hoare triple {1534#false} assume !false; {1534#false} is VALID [2020-07-11 00:34:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-11 00:34:28,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706133865] [2020-07-11 00:34:28,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:28,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:34:28,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447065957] [2020-07-11 00:34:28,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 00:34:28,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:28,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:28,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:28,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:28,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:28,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:28,436 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2020-07-11 00:34:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:28,807 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2020-07-11 00:34:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:34:28,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 00:34:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:34:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:34:28,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-11 00:34:28,864 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-11 00:34:28,869 INFO L225 Difference]: With dead ends: 53 [2020-07-11 00:34:28,869 INFO L226 Difference]: Without dead ends: 47 [2020-07-11 00:34:28,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:34:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-11 00:34:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-11 00:34:28,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:28,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-11 00:34:28,962 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-11 00:34:28,962 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-11 00:34:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:28,965 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-11 00:34:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-11 00:34:28,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:28,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:28,966 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-11 00:34:28,966 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-11 00:34:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:28,969 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-11 00:34:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-11 00:34:28,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:28,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:28,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:28,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 00:34:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-11 00:34:28,973 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2020-07-11 00:34:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:28,973 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-11 00:34:28,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:28,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2020-07-11 00:34:29,061 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-11 00:34:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-11 00:34:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-11 00:34:29,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:29,063 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-07-11 00:34:29,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:34:29,064 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:29,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1010225367, now seen corresponding path program 1 times [2020-07-11 00:34:29,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:29,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580048791] [2020-07-11 00:34:29,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:29,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-11 00:34:29,129 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1871#true} {1871#true} #64#return; {1871#true} is VALID [2020-07-11 00:34:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:29,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,244 INFO L280 TraceCheckUtils]: 3: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,246 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,249 INFO L263 TraceCheckUtils]: 5: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID [2020-07-11 00:34:29,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,254 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,257 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:29,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1871#true} is VALID [2020-07-11 00:34:29,259 INFO L280 TraceCheckUtils]: 3: Hoare triple {1871#true} assume !(~y1 == ~y2); {1871#true} is VALID [2020-07-11 00:34:29,259 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} assume ~y1 > ~y2; {1871#true} is VALID [2020-07-11 00:34:29,259 INFO L263 TraceCheckUtils]: 5: Hoare triple {1871#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1871#true} is VALID [2020-07-11 00:34:29,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,262 INFO L263 TraceCheckUtils]: 11: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID [2020-07-11 00:34:29,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,266 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,267 INFO L280 TraceCheckUtils]: 19: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,268 INFO L280 TraceCheckUtils]: 20: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,268 INFO L280 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,269 INFO L280 TraceCheckUtils]: 22: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,270 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:29,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:29,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,272 INFO L280 TraceCheckUtils]: 26: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,273 INFO L280 TraceCheckUtils]: 27: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,274 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #68#return; {1904#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:29,275 INFO L263 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2020-07-11 00:34:29,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-11 00:34:29,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #64#return; {1871#true} is VALID [2020-07-11 00:34:29,275 INFO L263 TraceCheckUtils]: 3: Hoare triple {1871#true} call #t~ret5 := main(); {1871#true} is VALID [2020-07-11 00:34:29,275 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1871#true} is VALID [2020-07-11 00:34:29,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {1871#true} ~m~0 := #t~nondet2; {1871#true} is VALID [2020-07-11 00:34:29,276 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} havoc #t~nondet2; {1871#true} is VALID [2020-07-11 00:34:29,276 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1871#true} is VALID [2020-07-11 00:34:29,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1871#true} is VALID [2020-07-11 00:34:29,277 INFO L280 TraceCheckUtils]: 9: Hoare triple {1871#true} ~n~0 := #t~nondet3; {1871#true} is VALID [2020-07-11 00:34:29,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {1871#true} havoc #t~nondet3; {1871#true} is VALID [2020-07-11 00:34:29,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {1871#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1871#true} is VALID [2020-07-11 00:34:29,277 INFO L263 TraceCheckUtils]: 12: Hoare triple {1871#true} call #t~ret4 := gcd(~m~0, ~n~0); {1871#true} is VALID [2020-07-11 00:34:29,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,278 INFO L280 TraceCheckUtils]: 14: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1871#true} is VALID [2020-07-11 00:34:29,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {1871#true} assume !(~y1 == ~y2); {1871#true} is VALID [2020-07-11 00:34:29,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {1871#true} assume ~y1 > ~y2; {1871#true} is VALID [2020-07-11 00:34:29,279 INFO L263 TraceCheckUtils]: 18: Hoare triple {1871#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1871#true} is VALID [2020-07-11 00:34:29,279 INFO L280 TraceCheckUtils]: 19: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,279 INFO L280 TraceCheckUtils]: 20: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,281 INFO L280 TraceCheckUtils]: 21: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,285 INFO L280 TraceCheckUtils]: 22: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,287 INFO L280 TraceCheckUtils]: 23: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,287 INFO L263 TraceCheckUtils]: 24: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID [2020-07-11 00:34:29,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-11 00:34:29,287 INFO L280 TraceCheckUtils]: 26: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-11 00:34:29,288 INFO L280 TraceCheckUtils]: 27: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,289 INFO L280 TraceCheckUtils]: 28: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-11 00:34:29,290 INFO L280 TraceCheckUtils]: 29: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,291 INFO L280 TraceCheckUtils]: 30: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,292 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,293 INFO L280 TraceCheckUtils]: 32: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1934#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-11 00:34:29,294 INFO L280 TraceCheckUtils]: 33: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,294 INFO L280 TraceCheckUtils]: 34: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,295 INFO L280 TraceCheckUtils]: 35: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,296 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:29,296 INFO L280 TraceCheckUtils]: 37: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-11 00:34:29,297 INFO L280 TraceCheckUtils]: 38: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,297 INFO L280 TraceCheckUtils]: 39: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,298 INFO L280 TraceCheckUtils]: 40: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-11 00:34:29,299 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #68#return; {1904#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:29,300 INFO L280 TraceCheckUtils]: 42: Hoare triple {1904#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1904#(<= 1 |main_#t~ret4|)} is VALID [2020-07-11 00:34:29,301 INFO L280 TraceCheckUtils]: 43: Hoare triple {1904#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1905#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:29,302 INFO L280 TraceCheckUtils]: 44: Hoare triple {1905#(<= 1 main_~z~0)} havoc #t~ret4; {1905#(<= 1 main_~z~0)} is VALID [2020-07-11 00:34:29,303 INFO L280 TraceCheckUtils]: 45: Hoare triple {1905#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {1872#false} is VALID [2020-07-11 00:34:29,303 INFO L280 TraceCheckUtils]: 46: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2020-07-11 00:34:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-11 00:34:29,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580048791] [2020-07-11 00:34:29,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:29,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 00:34:29,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939059340] [2020-07-11 00:34:29,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-11 00:34:29,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:29,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:34:29,356 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-11 00:34:29,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:34:29,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:29,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:34:29,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:29,357 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 8 states. [2020-07-11 00:34:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:29,788 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-11 00:34:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 00:34:29,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-11 00:34:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-07-11 00:34:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-07-11 00:34:29,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2020-07-11 00:34:29,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:29,839 INFO L225 Difference]: With dead ends: 47 [2020-07-11 00:34:29,839 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:34:29,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:34:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:34:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:34:29,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:29,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:29,841 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:29,841 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:29,841 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:29,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:29,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:29,842 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:29,842 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:29,842 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:29,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:29,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:29,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:29,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:34:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:34:29,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2020-07-11 00:34:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:29,845 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:34:29,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:34:29,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:34:29,845 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-11 00:34:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:29,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:29,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:34:29,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:34:30,609 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:30,610 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:30,610 INFO L264 CegarLoopResult]: At program point gcdFINAL(lines 15 26) the Hoare annotation is: (let ((.cse0 (= gcd_~y1 |gcd_#in~y1|)) (.cse1 (= gcd_~y2 |gcd_#in~y2|))) (or (and .cse0 .cse1 (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))) (and .cse0 .cse1 (<= 1 |gcd_#res|)))) [2020-07-11 00:34:30,610 INFO L264 CegarLoopResult]: At program point gcdEXIT(lines 15 26) the Hoare annotation is: (let ((.cse0 (= gcd_~y1 |gcd_#in~y1|)) (.cse1 (= gcd_~y2 |gcd_#in~y2|))) (or (and .cse0 .cse1 (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))) (and .cse0 .cse1 (<= 1 |gcd_#res|)))) [2020-07-11 00:34:30,610 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2)) [2020-07-11 00:34:30,611 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 |gcd_#t~ret1|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2)) [2020-07-11 00:34:30,611 INFO L271 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2020-07-11 00:34:30,611 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,613 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 |gcd_#t~ret1|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2)) [2020-07-11 00:34:30,613 INFO L264 CegarLoopResult]: At program point L22(lines 22 24) the Hoare annotation is: (and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,614 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (<= 1 |gcd_#t~ret0|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,614 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 |gcd_#t~ret1|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (<= 1 |gcd_#res|) (< gcd_~y1 gcd_~y2)) [2020-07-11 00:34:30,614 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (<= 1 |gcd_#t~ret0|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,614 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,614 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (<= 1 |gcd_#t~ret0|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (<= 1 |gcd_#res|)) [2020-07-11 00:34:30,615 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,615 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))) [2020-07-11 00:34:30,615 INFO L264 CegarLoopResult]: At program point L16(lines 16 18) the Hoare annotation is: (and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-11 00:34:30,615 INFO L264 CegarLoopResult]: At program point L15(lines 15 26) the Hoare annotation is: (= gcd_~y1 |gcd_#in~y1|) [2020-07-11 00:34:30,615 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:30,616 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:34:30,616 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:34:30,616 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:30,616 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-11 00:34:30,616 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-11 00:34:30,616 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 00:34:30,616 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-11 00:34:30,617 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-11 00:34:30,617 INFO L271 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-07-11 00:34:30,617 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 28 43) the Hoare annotation is: true [2020-07-11 00:34:30,617 INFO L264 CegarLoopResult]: At program point L38(lines 38 42) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~z~0) (<= 1 main_~n~0)) [2020-07-11 00:34:30,617 INFO L271 CegarLoopResult]: At program point L38-1(lines 28 43) the Hoare annotation is: true [2020-07-11 00:34:30,617 INFO L264 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-11 00:34:30,618 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-07-11 00:34:30,618 INFO L271 CegarLoopResult]: At program point L30(lines 30 32) the Hoare annotation is: true [2020-07-11 00:34:30,618 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2020-07-11 00:34:30,618 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-11 00:34:30,619 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-07-11 00:34:30,619 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-11 00:34:30,619 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-11 00:34:30,619 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-11 00:34:30,619 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-11 00:34:30,619 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= 1 main_~m~0) (<= 1 main_~z~0) (<= 1 main_~n~0)) [2020-07-11 00:34:30,643 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:34:30,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:34:30 BoogieIcfgContainer [2020-07-11 00:34:30,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:34:30,664 INFO L168 Benchmark]: Toolchain (without parser) took 8270.27 ms. Allocated memory was 138.9 MB in the beginning and 299.4 MB in the end (delta: 160.4 MB). Free memory was 104.0 MB in the beginning and 126.2 MB in the end (delta: -22.2 MB). Peak memory consumption was 138.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:30,669 INFO L168 Benchmark]: CDTParser took 1.05 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:34:30,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.59 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 93.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:30,672 INFO L168 Benchmark]: Boogie Preprocessor took 32.94 ms. Allocated memory is still 138.9 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:30,672 INFO L168 Benchmark]: RCFGBuilder took 544.95 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 92.4 MB in the beginning and 160.0 MB in the end (delta: -67.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:30,673 INFO L168 Benchmark]: TraceAbstraction took 7410.37 ms. Allocated memory was 203.4 MB in the beginning and 299.4 MB in the end (delta: 95.9 MB). Free memory was 159.3 MB in the beginning and 126.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 129.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:30,681 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 1.05 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 269.59 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 93.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.94 ms. Allocated memory is still 138.9 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 544.95 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 92.4 MB in the beginning and 160.0 MB in the end (delta: -67.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7410.37 ms. Allocated memory was 203.4 MB in the beginning and 299.4 MB in the end (delta: 95.9 MB). Free memory was 159.3 MB in the beginning and 126.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 129.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: 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 - ProcedureContractResult [Line: 15]: Procedure Contract for gcd Derived contract for procedure gcd: ((y1 == \old(y1) && y2 == \old(y2)) && (\old(y2) <= 0 || \old(y1) <= 0)) || ((y1 == \old(y1) && y2 == \old(y2)) && 1 <= \result) - ProcedureContractResult [Line: 28]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.5s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 227 SDtfs, 215 SDslu, 754 SDs, 0 SdLazy, 352 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 77 PreInvPairs, 139 NumberOfFragments, 341 HoareAnnotationTreeSize, 77 FomulaSimplifications, 1448 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 43 FomulaSimplificationsInter, 410 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 15935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 41/41 InterpolantCoveringCapability, 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...