/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-46f3038-m [2020-07-08 21:49:37,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:49:37,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:49:37,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:49:37,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:49:37,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:49:37,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:49:37,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:49:37,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:49:37,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:49:37,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:49:37,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:49:37,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:49:37,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:49:37,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:49:37,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:49:37,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:49:37,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:49:37,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:49:37,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:49:37,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:49:37,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:49:37,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:49:37,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:49:37,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:49:37,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:49:37,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:49:37,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:49:37,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:49:37,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:49:37,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:49:37,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:49:37,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:49:37,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:49:37,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:49:37,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:49:37,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:49:37,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:49:37,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:49:37,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:49:37,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:49:37,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:49:37,500 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:49:37,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:49:37,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:49:37,503 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:49:37,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:49:37,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:49:37,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:49:37,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:49:37,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:49:37,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:49:37,505 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:49:37,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:49:37,505 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:49:37,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:49:37,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:49:37,506 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:49:37,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:49:37,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:49:37,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:49:37,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:49:37,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:49:37,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:49:37,507 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-08 21:49:37,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:49:37,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:49:37,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:49:37,827 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:49:37,827 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:49:37,828 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-08 21:49:37,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918e4ff7/552fe18b7caf4d6a985841273754785a/FLAG056ac5088 [2020-07-08 21:49:38,407 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:49:38,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-08 21:49:38,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918e4ff7/552fe18b7caf4d6a985841273754785a/FLAG056ac5088 [2020-07-08 21:49:38,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918e4ff7/552fe18b7caf4d6a985841273754785a [2020-07-08 21:49:38,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:49:38,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:49:38,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:38,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:49:38,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:49:38,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:38" (1/1) ... [2020-07-08 21:49:38,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20609d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:38, skipping insertion in model container [2020-07-08 21:49:38,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:38" (1/1) ... [2020-07-08 21:49:38,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:49:38,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:49:39,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:39,057 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:49:39,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:39,093 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:49:39,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39 WrapperNode [2020-07-08 21:49:39,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:39,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:49:39,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:49:39,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:49:39,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (1/1) ... [2020-07-08 21:49:39,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:49:39,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:49:39,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:49:39,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:49:39,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (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-08 21:49:39,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:49:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:49:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2020-07-08 21:49:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 21:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2020-07-08 21:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:49:39,692 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:49:39,692 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 21:49:39,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:39 BoogieIcfgContainer [2020-07-08 21:49:39,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:49:39,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:49:39,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:49:39,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:49:39,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:49:38" (1/3) ... [2020-07-08 21:49:39,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449331da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:39, skipping insertion in model container [2020-07-08 21:49:39,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:39" (2/3) ... [2020-07-08 21:49:39,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449331da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:39, skipping insertion in model container [2020-07-08 21:49:39,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:39" (3/3) ... [2020-07-08 21:49:39,704 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2020-07-08 21:49:39,713 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:49:39,719 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:49:39,732 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:49:39,752 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:49:39,752 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:49:39,753 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:49:39,753 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:49:39,753 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:49:39,753 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:49:39,753 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:49:39,754 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:49:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-08 21:49:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 21:49:39,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:39,780 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-08 21:49:39,781 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1470222128, now seen corresponding path program 1 times [2020-07-08 21:49:39,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:39,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031225290] [2020-07-08 21:49:39,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:40,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-08 21:49:40,033 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {46#true} {46#true} #64#return; {46#true} is VALID [2020-07-08 21:49:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:40,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~y1 := #in~y1; {58#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:40,131 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-08 21:49:40,133 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-08 21:49:40,137 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-08 21:49:40,138 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-08 21:49:40,141 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-08 21:49:40,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2020-07-08 21:49:40,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-08 21:49:40,143 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #64#return; {46#true} is VALID [2020-07-08 21:49:40,144 INFO L263 TraceCheckUtils]: 3: Hoare triple {46#true} call #t~ret5 := main(); {46#true} is VALID [2020-07-08 21:49:40,144 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {46#true} is VALID [2020-07-08 21:49:40,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} ~m~0 := #t~nondet2; {46#true} is VALID [2020-07-08 21:49:40,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} havoc #t~nondet2; {46#true} is VALID [2020-07-08 21:49:40,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {50#(<= 1 main_~m~0)} is VALID [2020-07-08 21:49:40,148 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-08 21:49:40,149 INFO L280 TraceCheckUtils]: 9: Hoare triple {50#(<= 1 main_~m~0)} ~n~0 := #t~nondet3; {50#(<= 1 main_~m~0)} is VALID [2020-07-08 21:49:40,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(<= 1 main_~m~0)} havoc #t~nondet3; {50#(<= 1 main_~m~0)} is VALID [2020-07-08 21:49:40,151 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-08 21:49:40,152 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-08 21:49:40,153 INFO L280 TraceCheckUtils]: 13: Hoare triple {46#true} ~y1 := #in~y1; {58#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:40,154 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-08 21:49:40,156 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-08 21:49:40,157 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-08 21:49:40,158 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-08 21:49:40,160 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-08 21:49:40,161 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {47#false} is VALID [2020-07-08 21:49:40,161 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~z~0 := #t~ret4; {47#false} is VALID [2020-07-08 21:49:40,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} havoc #t~ret4; {47#false} is VALID [2020-07-08 21:49:40,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {47#false} is VALID [2020-07-08 21:49:40,162 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-08 21:49:40,166 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-08 21:49:40,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031225290] [2020-07-08 21:49:40,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:40,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 21:49:40,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046567601] [2020-07-08 21:49:40,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 21:49:40,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:40,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:40,235 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-08 21:49:40,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:40,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:40,249 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 7 states. [2020-07-08 21:49:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:40,788 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2020-07-08 21:49:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:40,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 21:49:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2020-07-08 21:49:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2020-07-08 21:49:40,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2020-07-08 21:49:40,904 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-08 21:49:40,918 INFO L225 Difference]: With dead ends: 60 [2020-07-08 21:49:40,919 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 21:49:40,923 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-08 21:49:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 21:49:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-08 21:49:41,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:41,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-08 21:49:41,045 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-08 21:49:41,045 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-08 21:49:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:41,053 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-08 21:49:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-08 21:49:41,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:41,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:41,055 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-08 21:49:41,055 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-08 21:49:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:41,061 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-08 21:49:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-08 21:49:41,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:41,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:41,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:41,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 21:49:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-08 21:49:41,070 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2020-07-08 21:49:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:41,070 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-08 21:49:41,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:41,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2020-07-08 21:49:41,133 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-08 21:49:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-08 21:49:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 21:49:41,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:41,135 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-08 21:49:41,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:49:41,136 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 831268307, now seen corresponding path program 1 times [2020-07-08 21:49:41,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:41,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1040156973] [2020-07-08 21:49:41,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:41,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} assume true; {337#true} is VALID [2020-07-08 21:49:41,216 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {337#true} {337#true} #64#return; {337#true} is VALID [2020-07-08 21:49:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:41,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} ~y1 := #in~y1; {337#true} is VALID [2020-07-08 21:49:41,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} ~y2 := #in~y2; {337#true} is VALID [2020-07-08 21:49:41,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {337#true} assume !(~y1 <= 0 || ~y2 <= 0); {350#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:41,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {350#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {350#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:41,275 INFO L280 TraceCheckUtils]: 4: Hoare triple {350#(<= 1 gcd_~y1)} #res := ~y1; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:41,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {351#(<= 1 |gcd_#res|)} assume true; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:41,277 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {351#(<= 1 |gcd_#res|)} {337#true} #68#return; {348#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:41,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2020-07-08 21:49:41,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} assume true; {337#true} is VALID [2020-07-08 21:49:41,278 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {337#true} {337#true} #64#return; {337#true} is VALID [2020-07-08 21:49:41,279 INFO L263 TraceCheckUtils]: 3: Hoare triple {337#true} call #t~ret5 := main(); {337#true} is VALID [2020-07-08 21:49:41,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {337#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {337#true} is VALID [2020-07-08 21:49:41,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#true} ~m~0 := #t~nondet2; {337#true} is VALID [2020-07-08 21:49:41,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {337#true} havoc #t~nondet2; {337#true} is VALID [2020-07-08 21:49:41,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {337#true} is VALID [2020-07-08 21:49:41,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {337#true} is VALID [2020-07-08 21:49:41,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {337#true} ~n~0 := #t~nondet3; {337#true} is VALID [2020-07-08 21:49:41,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#true} havoc #t~nondet3; {337#true} is VALID [2020-07-08 21:49:41,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {337#true} is VALID [2020-07-08 21:49:41,283 INFO L263 TraceCheckUtils]: 12: Hoare triple {337#true} call #t~ret4 := gcd(~m~0, ~n~0); {337#true} is VALID [2020-07-08 21:49:41,283 INFO L280 TraceCheckUtils]: 13: Hoare triple {337#true} ~y1 := #in~y1; {337#true} is VALID [2020-07-08 21:49:41,283 INFO L280 TraceCheckUtils]: 14: Hoare triple {337#true} ~y2 := #in~y2; {337#true} is VALID [2020-07-08 21:49:41,285 INFO L280 TraceCheckUtils]: 15: Hoare triple {337#true} assume !(~y1 <= 0 || ~y2 <= 0); {350#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:41,286 INFO L280 TraceCheckUtils]: 16: Hoare triple {350#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {350#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:41,287 INFO L280 TraceCheckUtils]: 17: Hoare triple {350#(<= 1 gcd_~y1)} #res := ~y1; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:41,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(<= 1 |gcd_#res|)} assume true; {351#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:41,289 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {351#(<= 1 |gcd_#res|)} {337#true} #68#return; {348#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:41,290 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-08 21:49:41,293 INFO L280 TraceCheckUtils]: 21: Hoare triple {348#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {349#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:41,294 INFO L280 TraceCheckUtils]: 22: Hoare triple {349#(<= 1 main_~z~0)} havoc #t~ret4; {349#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:41,295 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-08 21:49:41,296 INFO L280 TraceCheckUtils]: 24: Hoare triple {338#false} assume !false; {338#false} is VALID [2020-07-08 21:49:41,298 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-08 21:49:41,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1040156973] [2020-07-08 21:49:41,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:41,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 21:49:41,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047465153] [2020-07-08 21:49:41,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-08 21:49:41,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:41,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:49:41,336 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-08 21:49:41,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:49:41,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:49:41,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:49:41,338 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states. [2020-07-08 21:49:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:41,718 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-07-08 21:49:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:41,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-08 21:49:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:49:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-08 21:49:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:49:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-08 21:49:41,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-08 21:49:41,785 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-08 21:49:41,789 INFO L225 Difference]: With dead ends: 46 [2020-07-08 21:49:41,789 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 21:49:41,790 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-08 21:49:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 21:49:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2020-07-08 21:49:41,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:41,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2020-07-08 21:49:41,868 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2020-07-08 21:49:41,868 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2020-07-08 21:49:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:41,873 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-08 21:49:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-08 21:49:41,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:41,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:41,875 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2020-07-08 21:49:41,875 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2020-07-08 21:49:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:41,879 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-08 21:49:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-08 21:49:41,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:41,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:41,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:41,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 21:49:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-08 21:49:41,885 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2020-07-08 21:49:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:41,885 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-08 21:49:41,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:49:41,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2020-07-08 21:49:41,940 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-08 21:49:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-08 21:49:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 21:49:41,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:41,942 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-08 21:49:41,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:49:41,942 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -852904039, now seen corresponding path program 1 times [2020-07-08 21:49:41,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:41,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [451623934] [2020-07-08 21:49:41,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:42,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} assume true; {606#true} is VALID [2020-07-08 21:49:42,002 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {606#true} {606#true} #64#return; {606#true} is VALID [2020-07-08 21:49:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:42,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:42,156 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-08 21:49:42,157 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-08 21:49:42,158 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-08 21:49:42,159 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-08 21:49:42,161 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-08 21:49:42,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} ~y1 := #in~y1; {606#true} is VALID [2020-07-08 21:49:42,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} ~y2 := #in~y2; {606#true} is VALID [2020-07-08 21:49:42,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {606#true} assume !(~y1 <= 0 || ~y2 <= 0); {627#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:42,163 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-08 21:49:42,164 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-08 21:49:42,165 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-08 21:49:42,165 INFO L280 TraceCheckUtils]: 6: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:42,166 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-08 21:49:42,167 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-08 21:49:42,168 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-08 21:49:42,169 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-08 21:49:42,170 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-08 21:49:42,171 INFO L280 TraceCheckUtils]: 12: Hoare triple {607#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {607#false} is VALID [2020-07-08 21:49:42,171 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#false} #res := #t~ret1; {607#false} is VALID [2020-07-08 21:49:42,171 INFO L280 TraceCheckUtils]: 14: Hoare triple {607#false} havoc #t~ret1; {607#false} is VALID [2020-07-08 21:49:42,172 INFO L280 TraceCheckUtils]: 15: Hoare triple {607#false} assume true; {607#false} is VALID [2020-07-08 21:49:42,172 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {607#false} {606#true} #68#return; {607#false} is VALID [2020-07-08 21:49:42,173 INFO L263 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID [2020-07-08 21:49:42,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} assume true; {606#true} is VALID [2020-07-08 21:49:42,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {606#true} {606#true} #64#return; {606#true} is VALID [2020-07-08 21:49:42,174 INFO L263 TraceCheckUtils]: 3: Hoare triple {606#true} call #t~ret5 := main(); {606#true} is VALID [2020-07-08 21:49:42,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {606#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {606#true} is VALID [2020-07-08 21:49:42,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {606#true} ~m~0 := #t~nondet2; {606#true} is VALID [2020-07-08 21:49:42,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {606#true} havoc #t~nondet2; {606#true} is VALID [2020-07-08 21:49:42,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {606#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {606#true} is VALID [2020-07-08 21:49:42,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {606#true} is VALID [2020-07-08 21:49:42,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#true} ~n~0 := #t~nondet3; {606#true} is VALID [2020-07-08 21:49:42,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {606#true} havoc #t~nondet3; {606#true} is VALID [2020-07-08 21:49:42,176 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {606#true} is VALID [2020-07-08 21:49:42,176 INFO L263 TraceCheckUtils]: 12: Hoare triple {606#true} call #t~ret4 := gcd(~m~0, ~n~0); {606#true} is VALID [2020-07-08 21:49:42,176 INFO L280 TraceCheckUtils]: 13: Hoare triple {606#true} ~y1 := #in~y1; {606#true} is VALID [2020-07-08 21:49:42,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {606#true} ~y2 := #in~y2; {606#true} is VALID [2020-07-08 21:49:42,178 INFO L280 TraceCheckUtils]: 15: Hoare triple {606#true} assume !(~y1 <= 0 || ~y2 <= 0); {627#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:42,179 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-08 21:49:42,179 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-08 21:49:42,180 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-08 21:49:42,180 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:42,181 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-08 21:49:42,182 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-08 21:49:42,182 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-08 21:49:42,183 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-08 21:49:42,184 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-08 21:49:42,185 INFO L280 TraceCheckUtils]: 25: Hoare triple {607#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {607#false} is VALID [2020-07-08 21:49:42,185 INFO L280 TraceCheckUtils]: 26: Hoare triple {607#false} #res := #t~ret1; {607#false} is VALID [2020-07-08 21:49:42,185 INFO L280 TraceCheckUtils]: 27: Hoare triple {607#false} havoc #t~ret1; {607#false} is VALID [2020-07-08 21:49:42,185 INFO L280 TraceCheckUtils]: 28: Hoare triple {607#false} assume true; {607#false} is VALID [2020-07-08 21:49:42,186 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {607#false} {606#true} #68#return; {607#false} is VALID [2020-07-08 21:49:42,186 INFO L280 TraceCheckUtils]: 30: Hoare triple {607#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {607#false} is VALID [2020-07-08 21:49:42,186 INFO L280 TraceCheckUtils]: 31: Hoare triple {607#false} ~z~0 := #t~ret4; {607#false} is VALID [2020-07-08 21:49:42,187 INFO L280 TraceCheckUtils]: 32: Hoare triple {607#false} havoc #t~ret4; {607#false} is VALID [2020-07-08 21:49:42,187 INFO L280 TraceCheckUtils]: 33: Hoare triple {607#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {607#false} is VALID [2020-07-08 21:49:42,187 INFO L280 TraceCheckUtils]: 34: Hoare triple {607#false} assume !false; {607#false} is VALID [2020-07-08 21:49:42,189 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-08 21:49:42,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [451623934] [2020-07-08 21:49:42,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:42,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 21:49:42,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870387857] [2020-07-08 21:49:42,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-08 21:49:42,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:42,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 21:49:42,232 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-08 21:49:42,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 21:49:42,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:42,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 21:49:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 21:49:42,233 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2020-07-08 21:49:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:42,777 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-08 21:49:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 21:49:42,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-08 21:49:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2020-07-08 21:49:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2020-07-08 21:49:42,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2020-07-08 21:49:42,877 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-08 21:49:42,882 INFO L225 Difference]: With dead ends: 56 [2020-07-08 21:49:42,882 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 21:49:42,883 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-08 21:49:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 21:49:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-08 21:49:42,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:42,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-08 21:49:42,962 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-08 21:49:42,963 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-08 21:49:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:42,967 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 21:49:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 21:49:42,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:42,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:42,968 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-08 21:49:42,968 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-08 21:49:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:42,975 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 21:49:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 21:49:42,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:42,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:42,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:42,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 21:49:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-07-08 21:49:42,979 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 35 [2020-07-08 21:49:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:42,979 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-07-08 21:49:42,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 21:49:42,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 45 transitions. [2020-07-08 21:49:43,043 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-08 21:49:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-08 21:49:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 21:49:43,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:43,045 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-08 21:49:43,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 21:49:43,046 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2030561919, now seen corresponding path program 1 times [2020-07-08 21:49:43,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:43,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021889190] [2020-07-08 21:49:43,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:43,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} assume true; {925#true} is VALID [2020-07-08 21:49:43,099 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {925#true} {925#true} #64#return; {925#true} is VALID [2020-07-08 21:49:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:43,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:43,234 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-08 21:49:43,235 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-08 21:49:43,236 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-08 21:49:43,236 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-08 21:49:43,238 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-08 21:49:43,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} ~y1 := #in~y1; {925#true} is VALID [2020-07-08 21:49:43,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {925#true} ~y2 := #in~y2; {925#true} is VALID [2020-07-08 21:49:43,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {925#true} assume !(~y1 <= 0 || ~y2 <= 0); {946#(<= 1 gcd_~y2)} is VALID [2020-07-08 21:49:43,240 INFO L280 TraceCheckUtils]: 3: Hoare triple {946#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {946#(<= 1 gcd_~y2)} is VALID [2020-07-08 21:49:43,241 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-08 21:49:43,241 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-08 21:49:43,242 INFO L280 TraceCheckUtils]: 6: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:43,243 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-08 21:49:43,243 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-08 21:49:43,244 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-08 21:49:43,245 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-08 21:49:43,246 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-08 21:49:43,247 INFO L280 TraceCheckUtils]: 12: Hoare triple {926#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {926#false} is VALID [2020-07-08 21:49:43,247 INFO L280 TraceCheckUtils]: 13: Hoare triple {926#false} #res := #t~ret0; {926#false} is VALID [2020-07-08 21:49:43,247 INFO L280 TraceCheckUtils]: 14: Hoare triple {926#false} havoc #t~ret0; {926#false} is VALID [2020-07-08 21:49:43,247 INFO L280 TraceCheckUtils]: 15: Hoare triple {926#false} assume true; {926#false} is VALID [2020-07-08 21:49:43,248 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {926#false} {925#true} #68#return; {926#false} is VALID [2020-07-08 21:49:43,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2020-07-08 21:49:43,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID [2020-07-08 21:49:43,249 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #64#return; {925#true} is VALID [2020-07-08 21:49:43,249 INFO L263 TraceCheckUtils]: 3: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2020-07-08 21:49:43,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {925#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {925#true} is VALID [2020-07-08 21:49:43,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {925#true} ~m~0 := #t~nondet2; {925#true} is VALID [2020-07-08 21:49:43,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {925#true} havoc #t~nondet2; {925#true} is VALID [2020-07-08 21:49:43,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {925#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {925#true} is VALID [2020-07-08 21:49:43,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {925#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {925#true} is VALID [2020-07-08 21:49:43,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {925#true} ~n~0 := #t~nondet3; {925#true} is VALID [2020-07-08 21:49:43,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {925#true} havoc #t~nondet3; {925#true} is VALID [2020-07-08 21:49:43,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {925#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {925#true} is VALID [2020-07-08 21:49:43,251 INFO L263 TraceCheckUtils]: 12: Hoare triple {925#true} call #t~ret4 := gcd(~m~0, ~n~0); {925#true} is VALID [2020-07-08 21:49:43,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {925#true} ~y1 := #in~y1; {925#true} is VALID [2020-07-08 21:49:43,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {925#true} ~y2 := #in~y2; {925#true} is VALID [2020-07-08 21:49:43,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {925#true} assume !(~y1 <= 0 || ~y2 <= 0); {946#(<= 1 gcd_~y2)} is VALID [2020-07-08 21:49:43,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {946#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {946#(<= 1 gcd_~y2)} is VALID [2020-07-08 21:49:43,254 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-08 21:49:43,255 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-08 21:49:43,255 INFO L280 TraceCheckUtils]: 19: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID [2020-07-08 21:49:43,256 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-08 21:49:43,257 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-08 21:49:43,257 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-08 21:49:43,258 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-08 21:49:43,259 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-08 21:49:43,260 INFO L280 TraceCheckUtils]: 25: Hoare triple {926#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {926#false} is VALID [2020-07-08 21:49:43,260 INFO L280 TraceCheckUtils]: 26: Hoare triple {926#false} #res := #t~ret0; {926#false} is VALID [2020-07-08 21:49:43,260 INFO L280 TraceCheckUtils]: 27: Hoare triple {926#false} havoc #t~ret0; {926#false} is VALID [2020-07-08 21:49:43,260 INFO L280 TraceCheckUtils]: 28: Hoare triple {926#false} assume true; {926#false} is VALID [2020-07-08 21:49:43,261 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {926#false} {925#true} #68#return; {926#false} is VALID [2020-07-08 21:49:43,261 INFO L280 TraceCheckUtils]: 30: Hoare triple {926#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {926#false} is VALID [2020-07-08 21:49:43,261 INFO L280 TraceCheckUtils]: 31: Hoare triple {926#false} ~z~0 := #t~ret4; {926#false} is VALID [2020-07-08 21:49:43,261 INFO L280 TraceCheckUtils]: 32: Hoare triple {926#false} havoc #t~ret4; {926#false} is VALID [2020-07-08 21:49:43,261 INFO L280 TraceCheckUtils]: 33: Hoare triple {926#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {926#false} is VALID [2020-07-08 21:49:43,262 INFO L280 TraceCheckUtils]: 34: Hoare triple {926#false} assume !false; {926#false} is VALID [2020-07-08 21:49:43,263 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-08 21:49:43,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021889190] [2020-07-08 21:49:43,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:43,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 21:49:43,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422436331] [2020-07-08 21:49:43,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-08 21:49:43,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:43,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:43,297 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-08 21:49:43,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:43,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:43,298 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2020-07-08 21:49:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:43,683 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-08 21:49:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:43,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-08 21:49:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2020-07-08 21:49:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2020-07-08 21:49:43,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2020-07-08 21:49:43,763 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-08 21:49:43,766 INFO L225 Difference]: With dead ends: 56 [2020-07-08 21:49:43,766 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 21:49:43,768 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-08 21:49:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 21:49:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-08 21:49:43,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:43,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-08 21:49:43,850 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-08 21:49:43,851 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-08 21:49:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:43,854 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-08 21:49:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-08 21:49:43,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:43,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:43,855 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-08 21:49:43,855 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-08 21:49:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:43,858 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-08 21:49:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-08 21:49:43,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:43,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:43,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:43,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 21:49:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-08 21:49:43,862 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 35 [2020-07-08 21:49:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:43,862 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-08 21:49:43,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:43,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-08 21:49:43,919 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-08 21:49:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-08 21:49:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 21:49:43,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:43,921 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-08 21:49:43,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 21:49:43,922 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2122258312, now seen corresponding path program 1 times [2020-07-08 21:49:43,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:43,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204103092] [2020-07-08 21:49:43,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:43,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} assume true; {1229#true} is VALID [2020-07-08 21:49:43,969 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1229#true} {1229#true} #64#return; {1229#true} is VALID [2020-07-08 21:49:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:44,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-08 21:49:44,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-08 21:49:44,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,029 INFO L280 TraceCheckUtils]: 3: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,032 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-08 21:49:44,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-08 21:49:44,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-08 21:49:44,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,034 INFO L280 TraceCheckUtils]: 3: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,035 INFO L263 TraceCheckUtils]: 5: Hoare triple {1253#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1229#true} is VALID [2020-07-08 21:49:44,035 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-08 21:49:44,035 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-08 21:49:44,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,040 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-08 21:49:44,041 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-08 21:49:44,041 INFO L280 TraceCheckUtils]: 14: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,042 INFO L280 TraceCheckUtils]: 15: Hoare triple {1262#(<= 1 |gcd_#res|)} havoc #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,044 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1229#true} #68#return; {1251#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:44,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {1229#true} call ULTIMATE.init(); {1229#true} is VALID [2020-07-08 21:49:44,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} assume true; {1229#true} is VALID [2020-07-08 21:49:44,045 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1229#true} {1229#true} #64#return; {1229#true} is VALID [2020-07-08 21:49:44,046 INFO L263 TraceCheckUtils]: 3: Hoare triple {1229#true} call #t~ret5 := main(); {1229#true} is VALID [2020-07-08 21:49:44,046 INFO L280 TraceCheckUtils]: 4: Hoare triple {1229#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1229#true} is VALID [2020-07-08 21:49:44,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {1229#true} ~m~0 := #t~nondet2; {1229#true} is VALID [2020-07-08 21:49:44,046 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#true} havoc #t~nondet2; {1229#true} is VALID [2020-07-08 21:49:44,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1229#true} is VALID [2020-07-08 21:49:44,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1229#true} is VALID [2020-07-08 21:49:44,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {1229#true} ~n~0 := #t~nondet3; {1229#true} is VALID [2020-07-08 21:49:44,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {1229#true} havoc #t~nondet3; {1229#true} is VALID [2020-07-08 21:49:44,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1229#true} is VALID [2020-07-08 21:49:44,048 INFO L263 TraceCheckUtils]: 12: Hoare triple {1229#true} call #t~ret4 := gcd(~m~0, ~n~0); {1229#true} is VALID [2020-07-08 21:49:44,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-08 21:49:44,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-08 21:49:44,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,050 INFO L280 TraceCheckUtils]: 16: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,051 INFO L263 TraceCheckUtils]: 18: Hoare triple {1253#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1229#true} is VALID [2020-07-08 21:49:44,052 INFO L280 TraceCheckUtils]: 19: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID [2020-07-08 21:49:44,052 INFO L280 TraceCheckUtils]: 20: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID [2020-07-08 21:49:44,053 INFO L280 TraceCheckUtils]: 21: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,055 INFO L280 TraceCheckUtils]: 23: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,055 INFO L280 TraceCheckUtils]: 24: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,057 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-08 21:49:44,057 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-08 21:49:44,058 INFO L280 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,059 INFO L280 TraceCheckUtils]: 28: Hoare triple {1262#(<= 1 |gcd_#res|)} havoc #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,059 INFO L280 TraceCheckUtils]: 29: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,060 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1229#true} #68#return; {1251#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:44,061 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-08 21:49:44,062 INFO L280 TraceCheckUtils]: 32: Hoare triple {1251#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1252#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:44,062 INFO L280 TraceCheckUtils]: 33: Hoare triple {1252#(<= 1 main_~z~0)} havoc #t~ret4; {1252#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:44,063 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-08 21:49:44,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {1230#false} assume !false; {1230#false} is VALID [2020-07-08 21:49:44,065 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-08 21:49:44,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204103092] [2020-07-08 21:49:44,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:44,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 21:49:44,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855718868] [2020-07-08 21:49:44,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 21:49:44,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:44,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:44,105 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-08 21:49:44,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:44,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:44,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:44,107 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-07-08 21:49:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:44,466 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-08 21:49:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 21:49:44,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 21:49:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-08 21:49:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-08 21:49:44,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-08 21:49:44,521 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-08 21:49:44,523 INFO L225 Difference]: With dead ends: 48 [2020-07-08 21:49:44,523 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 21:49:44,523 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-08 21:49:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 21:49:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-08 21:49:44,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:44,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-08 21:49:44,608 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-08 21:49:44,608 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-08 21:49:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:44,611 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-08 21:49:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 21:49:44,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:44,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:44,612 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-08 21:49:44,612 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-08 21:49:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:44,615 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-08 21:49:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 21:49:44,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:44,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:44,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:44,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 21:49:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-08 21:49:44,619 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 36 [2020-07-08 21:49:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:44,619 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-08 21:49:44,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:44,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2020-07-08 21:49:44,671 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-08 21:49:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 21:49:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 21:49:44,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:44,672 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-08 21:49:44,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 21:49:44,672 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 404002040, now seen corresponding path program 1 times [2020-07-08 21:49:44,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:44,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821468209] [2020-07-08 21:49:44,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:44,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-08 21:49:44,712 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1533#true} {1533#true} #64#return; {1533#true} is VALID [2020-07-08 21:49:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:44,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-08 21:49:44,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-08 21:49:44,773 INFO L280 TraceCheckUtils]: 2: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,774 INFO L280 TraceCheckUtils]: 3: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,779 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 21:49:44,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-08 21:49:44,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-08 21:49:44,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1533#true} is VALID [2020-07-08 21:49:44,780 INFO L280 TraceCheckUtils]: 3: Hoare triple {1533#true} assume !(~y1 == ~y2); {1533#true} is VALID [2020-07-08 21:49:44,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume ~y1 > ~y2; {1533#true} is VALID [2020-07-08 21:49:44,781 INFO L263 TraceCheckUtils]: 5: Hoare triple {1533#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1533#true} is VALID [2020-07-08 21:49:44,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-08 21:49:44,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-08 21:49:44,782 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,783 INFO L280 TraceCheckUtils]: 10: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,784 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 21:49:44,784 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-08 21:49:44,785 INFO L280 TraceCheckUtils]: 14: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {1565#(<= 1 |gcd_#res|)} havoc #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,786 INFO L280 TraceCheckUtils]: 16: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,786 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #68#return; {1555#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:44,787 INFO L263 TraceCheckUtils]: 0: Hoare triple {1533#true} call ULTIMATE.init(); {1533#true} is VALID [2020-07-08 21:49:44,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-08 21:49:44,787 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1533#true} {1533#true} #64#return; {1533#true} is VALID [2020-07-08 21:49:44,788 INFO L263 TraceCheckUtils]: 3: Hoare triple {1533#true} call #t~ret5 := main(); {1533#true} is VALID [2020-07-08 21:49:44,788 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1533#true} is VALID [2020-07-08 21:49:44,788 INFO L280 TraceCheckUtils]: 5: Hoare triple {1533#true} ~m~0 := #t~nondet2; {1533#true} is VALID [2020-07-08 21:49:44,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} havoc #t~nondet2; {1533#true} is VALID [2020-07-08 21:49:44,788 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1533#true} is VALID [2020-07-08 21:49:44,789 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1533#true} is VALID [2020-07-08 21:49:44,789 INFO L280 TraceCheckUtils]: 9: Hoare triple {1533#true} ~n~0 := #t~nondet3; {1533#true} is VALID [2020-07-08 21:49:44,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {1533#true} havoc #t~nondet3; {1533#true} is VALID [2020-07-08 21:49:44,789 INFO L280 TraceCheckUtils]: 11: Hoare triple {1533#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1533#true} is VALID [2020-07-08 21:49:44,790 INFO L263 TraceCheckUtils]: 12: Hoare triple {1533#true} call #t~ret4 := gcd(~m~0, ~n~0); {1533#true} is VALID [2020-07-08 21:49:44,790 INFO L280 TraceCheckUtils]: 13: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-08 21:49:44,790 INFO L280 TraceCheckUtils]: 14: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-08 21:49:44,790 INFO L280 TraceCheckUtils]: 15: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1533#true} is VALID [2020-07-08 21:49:44,790 INFO L280 TraceCheckUtils]: 16: Hoare triple {1533#true} assume !(~y1 == ~y2); {1533#true} is VALID [2020-07-08 21:49:44,791 INFO L280 TraceCheckUtils]: 17: Hoare triple {1533#true} assume ~y1 > ~y2; {1533#true} is VALID [2020-07-08 21:49:44,791 INFO L263 TraceCheckUtils]: 18: Hoare triple {1533#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1533#true} is VALID [2020-07-08 21:49:44,791 INFO L280 TraceCheckUtils]: 19: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID [2020-07-08 21:49:44,791 INFO L280 TraceCheckUtils]: 20: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID [2020-07-08 21:49:44,792 INFO L280 TraceCheckUtils]: 21: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:44,793 INFO L280 TraceCheckUtils]: 23: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,794 INFO L280 TraceCheckUtils]: 24: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,795 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 21:49:44,795 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-08 21:49:44,796 INFO L280 TraceCheckUtils]: 27: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,797 INFO L280 TraceCheckUtils]: 28: Hoare triple {1565#(<= 1 |gcd_#res|)} havoc #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,797 INFO L280 TraceCheckUtils]: 29: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:44,798 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #68#return; {1555#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:44,798 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-08 21:49:44,799 INFO L280 TraceCheckUtils]: 32: Hoare triple {1555#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1556#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:44,799 INFO L280 TraceCheckUtils]: 33: Hoare triple {1556#(<= 1 main_~z~0)} havoc #t~ret4; {1556#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:44,800 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-08 21:49:44,800 INFO L280 TraceCheckUtils]: 35: Hoare triple {1534#false} assume !false; {1534#false} is VALID [2020-07-08 21:49:44,801 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-08 21:49:44,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821468209] [2020-07-08 21:49:44,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:44,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 21:49:44,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368179995] [2020-07-08 21:49:44,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 21:49:44,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:44,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:44,850 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-08 21:49:44,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:44,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:44,852 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2020-07-08 21:49:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:45,227 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2020-07-08 21:49:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 21:49:45,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 21:49:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-08 21:49:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-08 21:49:45,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-08 21:49:45,296 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-08 21:49:45,300 INFO L225 Difference]: With dead ends: 53 [2020-07-08 21:49:45,300 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 21:49:45,301 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-08 21:49:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 21:49:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-08 21:49:45,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:45,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-08 21:49:45,408 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 21:49:45,408 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 21:49:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:45,411 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-08 21:49:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-08 21:49:45,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:45,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:45,412 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 21:49:45,412 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 21:49:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:45,415 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-08 21:49:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-08 21:49:45,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:45,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:45,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:45,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 21:49:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-08 21:49:45,419 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2020-07-08 21:49:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:45,420 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-08 21:49:45,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:45,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2020-07-08 21:49:45,508 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-08 21:49:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-08 21:49:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-08 21:49:45,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:45,510 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-08 21:49:45,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 21:49:45,511 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1010225367, now seen corresponding path program 1 times [2020-07-08 21:49:45,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:45,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845391236] [2020-07-08 21:49:45,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:45,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-08 21:49:45,560 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1871#true} {1871#true} #64#return; {1871#true} is VALID [2020-07-08 21:49:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:45,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,640 INFO L280 TraceCheckUtils]: 3: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,643 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-08 21:49:45,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,645 INFO L280 TraceCheckUtils]: 4: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,646 INFO L263 TraceCheckUtils]: 5: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID [2020-07-08 21:49:45,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,649 INFO L280 TraceCheckUtils]: 11: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,650 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-08 21:49:45,651 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-08 21:49:45,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,652 INFO L280 TraceCheckUtils]: 15: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,652 INFO L280 TraceCheckUtils]: 16: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,653 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 21:49:45,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1871#true} is VALID [2020-07-08 21:49:45,655 INFO L280 TraceCheckUtils]: 3: Hoare triple {1871#true} assume !(~y1 == ~y2); {1871#true} is VALID [2020-07-08 21:49:45,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} assume ~y1 > ~y2; {1871#true} is VALID [2020-07-08 21:49:45,655 INFO L263 TraceCheckUtils]: 5: Hoare triple {1871#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1871#true} is VALID [2020-07-08 21:49:45,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,657 INFO L280 TraceCheckUtils]: 9: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,658 INFO L263 TraceCheckUtils]: 11: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID [2020-07-08 21:49:45,658 INFO L280 TraceCheckUtils]: 12: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,660 INFO L280 TraceCheckUtils]: 15: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,661 INFO L280 TraceCheckUtils]: 17: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,662 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-08 21:49:45,663 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-08 21:49:45,663 INFO L280 TraceCheckUtils]: 20: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,666 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 21:49:45,666 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-08 21:49:45,667 INFO L280 TraceCheckUtils]: 25: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,668 INFO L280 TraceCheckUtils]: 26: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,668 INFO L280 TraceCheckUtils]: 27: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,669 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #68#return; {1904#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:45,670 INFO L263 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2020-07-08 21:49:45,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-08 21:49:45,671 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #64#return; {1871#true} is VALID [2020-07-08 21:49:45,671 INFO L263 TraceCheckUtils]: 3: Hoare triple {1871#true} call #t~ret5 := main(); {1871#true} is VALID [2020-07-08 21:49:45,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1871#true} is VALID [2020-07-08 21:49:45,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {1871#true} ~m~0 := #t~nondet2; {1871#true} is VALID [2020-07-08 21:49:45,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} havoc #t~nondet2; {1871#true} is VALID [2020-07-08 21:49:45,672 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1871#true} is VALID [2020-07-08 21:49:45,672 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1871#true} is VALID [2020-07-08 21:49:45,672 INFO L280 TraceCheckUtils]: 9: Hoare triple {1871#true} ~n~0 := #t~nondet3; {1871#true} is VALID [2020-07-08 21:49:45,672 INFO L280 TraceCheckUtils]: 10: Hoare triple {1871#true} havoc #t~nondet3; {1871#true} is VALID [2020-07-08 21:49:45,673 INFO L280 TraceCheckUtils]: 11: Hoare triple {1871#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1871#true} is VALID [2020-07-08 21:49:45,673 INFO L263 TraceCheckUtils]: 12: Hoare triple {1871#true} call #t~ret4 := gcd(~m~0, ~n~0); {1871#true} is VALID [2020-07-08 21:49:45,673 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,673 INFO L280 TraceCheckUtils]: 14: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1871#true} is VALID [2020-07-08 21:49:45,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {1871#true} assume !(~y1 == ~y2); {1871#true} is VALID [2020-07-08 21:49:45,674 INFO L280 TraceCheckUtils]: 17: Hoare triple {1871#true} assume ~y1 > ~y2; {1871#true} is VALID [2020-07-08 21:49:45,674 INFO L263 TraceCheckUtils]: 18: Hoare triple {1871#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1871#true} is VALID [2020-07-08 21:49:45,674 INFO L280 TraceCheckUtils]: 19: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,674 INFO L280 TraceCheckUtils]: 20: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,677 INFO L280 TraceCheckUtils]: 21: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,678 INFO L280 TraceCheckUtils]: 23: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,678 INFO L263 TraceCheckUtils]: 24: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID [2020-07-08 21:49:45,678 INFO L280 TraceCheckUtils]: 25: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID [2020-07-08 21:49:45,678 INFO L280 TraceCheckUtils]: 26: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID [2020-07-08 21:49:45,680 INFO L280 TraceCheckUtils]: 27: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,680 INFO L280 TraceCheckUtils]: 28: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID [2020-07-08 21:49:45,681 INFO L280 TraceCheckUtils]: 29: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,682 INFO L280 TraceCheckUtils]: 30: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,683 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-08 21:49:45,684 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-08 21:49:45,685 INFO L280 TraceCheckUtils]: 33: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,685 INFO L280 TraceCheckUtils]: 34: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,686 INFO L280 TraceCheckUtils]: 35: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,687 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 21:49:45,687 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-08 21:49:45,688 INFO L280 TraceCheckUtils]: 38: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,689 INFO L280 TraceCheckUtils]: 39: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,689 INFO L280 TraceCheckUtils]: 40: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID [2020-07-08 21:49:45,691 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #68#return; {1904#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 21:49:45,692 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-08 21:49:45,693 INFO L280 TraceCheckUtils]: 43: Hoare triple {1904#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1905#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:45,694 INFO L280 TraceCheckUtils]: 44: Hoare triple {1905#(<= 1 main_~z~0)} havoc #t~ret4; {1905#(<= 1 main_~z~0)} is VALID [2020-07-08 21:49:45,694 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-08 21:49:45,694 INFO L280 TraceCheckUtils]: 46: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2020-07-08 21:49:45,696 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-08 21:49:45,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845391236] [2020-07-08 21:49:45,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:45,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 21:49:45,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139460977] [2020-07-08 21:49:45,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-08 21:49:45,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:45,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 21:49:45,746 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-08 21:49:45,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 21:49:45,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:45,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 21:49:45,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 21:49:45,747 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 8 states. [2020-07-08 21:49:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:46,169 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-08 21:49:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 21:49:46,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-07-08 21:49:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-07-08 21:49:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-07-08 21:49:46,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2020-07-08 21:49:46,219 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-08 21:49:46,220 INFO L225 Difference]: With dead ends: 47 [2020-07-08 21:49:46,220 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 21:49:46,221 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-08 21:49:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 21:49:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 21:49:46,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:46,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:46,222 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:46,224 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:46,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 21:49:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 21:49:46,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:46,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:46,225 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:46,225 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:46,225 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 21:49:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 21:49:46,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:46,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:46,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:46,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 21:49:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 21:49:46,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2020-07-08 21:49:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:46,227 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 21:49:46,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 21:49:46,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 21:49:46,228 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-08 21:49:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 21:49:46,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:46,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 21:49:46,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 21:49:46,980 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 21:49:46,980 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 21:49:46,981 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-08 21:49:46,981 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-08 21:49:46,981 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-08 21:49:46,981 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-08 21:49:46,981 INFO L271 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2020-07-08 21:49:46,982 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-08 21:49:46,982 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-08 21:49:46,982 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-08 21:49:46,982 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-08 21:49:46,982 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-08 21:49:46,982 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-08 21:49:46,983 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-08 21:49:46,983 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-08 21:49:46,983 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-08 21:49:46,986 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-08 21:49:46,986 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-08 21:49:46,986 INFO L264 CegarLoopResult]: At program point L15(lines 15 26) the Hoare annotation is: (= gcd_~y1 |gcd_#in~y1|) [2020-07-08 21:49:46,986 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 21:49:46,986 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 21:49:46,987 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 21:49:46,987 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 21:49:46,987 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-08 21:49:46,987 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-08 21:49:46,987 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-08 21:49:46,987 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-08 21:49:46,987 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-08 21:49:46,987 INFO L271 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-07-08 21:49:46,988 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 28 43) the Hoare annotation is: true [2020-07-08 21:49:46,988 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-08 21:49:46,988 INFO L271 CegarLoopResult]: At program point L38-1(lines 28 43) the Hoare annotation is: true [2020-07-08 21:49:46,988 INFO L264 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-08 21:49:46,988 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-07-08 21:49:46,988 INFO L271 CegarLoopResult]: At program point L30(lines 30 32) the Hoare annotation is: true [2020-07-08 21:49:46,989 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2020-07-08 21:49:46,989 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-08 21:49:46,989 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-07-08 21:49:46,989 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-08 21:49:46,989 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-08 21:49:46,989 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (<= 1 main_~m~0) [2020-07-08 21:49:46,989 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-08 21:49:46,990 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-08 21:49:47,016 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-08 21:49:47,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 09:49:47 BoogieIcfgContainer [2020-07-08 21:49:47,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 21:49:47,037 INFO L168 Benchmark]: Toolchain (without parser) took 8202.28 ms. Allocated memory was 144.7 MB in the beginning and 303.6 MB in the end (delta: 158.9 MB). Free memory was 101.2 MB in the beginning and 160.6 MB in the end (delta: -59.4 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:47,039 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 21:49:47,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.64 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:47,044 INFO L168 Benchmark]: Boogie Preprocessor took 122.59 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 91.1 MB in the beginning and 180.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:47,045 INFO L168 Benchmark]: RCFGBuilder took 479.05 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 158.0 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:47,045 INFO L168 Benchmark]: TraceAbstraction took 7333.91 ms. Allocated memory was 201.9 MB in the beginning and 303.6 MB in the end (delta: 101.7 MB). Free memory was 157.0 MB in the beginning and 160.6 MB in the end (delta: -3.6 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:47,054 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.64 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.59 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 91.1 MB in the beginning and 180.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.05 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 158.0 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7333.91 ms. Allocated memory was 201.9 MB in the beginning and 303.6 MB in the end (delta: 101.7 MB). Free memory was 157.0 MB in the beginning and 160.6 MB in the end (delta: -3.6 MB). Peak memory consumption was 98.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.4s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.6s, 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.5s 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.6s 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.2s 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...