/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/gcd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:07:47,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:07:47,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:07:47,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:07:47,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:07:47,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:07:47,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:07:47,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:07:47,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:07:47,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:07:47,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:07:47,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:07:47,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:07:47,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:07:47,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:07:47,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:07:47,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:07:47,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:07:47,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:07:47,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:07:47,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:07:47,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:07:47,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:07:47,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:07:47,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:07:47,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:07:47,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:07:47,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:07:47,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:07:47,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:07:47,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:07:47,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:07:47,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:07:47,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:07:47,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:07:47,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:07:47,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:07:47,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:07:47,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:07:47,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:07:47,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:07:47,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:07:47,132 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:07:47,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:07:47,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:07:47,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:07:47,135 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:07:47,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:07:47,135 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:07:47,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:07:47,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:07:47,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:07:47,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:07:47,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:07:47,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:07:47,137 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:07:47,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:07:47,137 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:07:47,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:07:47,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:07:47,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:07:47,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:07:47,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:07:47,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:07:47,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:07:47,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:07:47,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:07:47,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:07:47,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:07:47,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:07:47,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:07:47,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:07:47,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:07:47,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:07:47,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:07:47,466 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:07:47,467 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:07:47,468 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-17 22:07:47,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564eac6ee/ba78dac159a24d458712c66883e8dc39/FLAGc944be830 [2020-07-17 22:07:48,027 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:07:48,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-17 22:07:48,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564eac6ee/ba78dac159a24d458712c66883e8dc39/FLAGc944be830 [2020-07-17 22:07:48,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564eac6ee/ba78dac159a24d458712c66883e8dc39 [2020-07-17 22:07:48,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:07:48,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:07:48,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:07:48,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:07:48,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:07:48,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66baa42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48, skipping insertion in model container [2020-07-17 22:07:48,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:07:48,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:07:48,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:07:48,701 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:07:48,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:07:48,740 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:07:48,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48 WrapperNode [2020-07-17 22:07:48,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:07:48,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:07:48,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:07:48,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:07:48,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (1/1) ... [2020-07-17 22:07:48,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:07:48,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:07:48,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:07:48,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:07:48,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (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-17 22:07:48,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:07:48,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:07:48,949 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2020-07-17 22:07:48,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:07:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:07:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:07:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2020-07-17 22:07:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:07:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:07:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:07:49,332 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:07:49,332 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:07:49,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:07:49 BoogieIcfgContainer [2020-07-17 22:07:49,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:07:49,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:07:49,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:07:49,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:07:49,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:07:48" (1/3) ... [2020-07-17 22:07:49,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39122955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:07:49, skipping insertion in model container [2020-07-17 22:07:49,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:48" (2/3) ... [2020-07-17 22:07:49,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39122955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:07:49, skipping insertion in model container [2020-07-17 22:07:49,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:07:49" (3/3) ... [2020-07-17 22:07:49,346 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2020-07-17 22:07:49,358 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:07:49,367 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:07:49,383 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:07:49,407 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:07:49,408 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:07:49,408 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:07:49,408 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:07:49,409 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:07:49,409 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:07:49,410 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:07:49,410 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:07:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-17 22:07:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:07:49,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:49,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:49,443 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1001932622, now seen corresponding path program 1 times [2020-07-17 22:07:49,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:49,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054191587] [2020-07-17 22:07:49,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:49,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-17 22:07:49,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2020-07-17 22:07:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:49,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~y1 := #in~y1;~y2 := #in~y2; {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:49,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:49,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:49,836 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #51#return; {30#false} is VALID [2020-07-17 22:07:49,837 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-17 22:07:49,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-17 22:07:49,838 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2020-07-17 22:07:49,838 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2020-07-17 22:07:49,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {29#true} is VALID [2020-07-17 22:07:49,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {33#(<= 1 main_~m~0)} is VALID [2020-07-17 22:07:49,841 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#(<= 1 main_~m~0)} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} is VALID [2020-07-17 22:07:49,842 INFO L263 TraceCheckUtils]: 7: Hoare triple {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} call #t~ret4 := gcd(~m~0, ~n~0); {29#true} is VALID [2020-07-17 22:07:49,843 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~y1 := #in~y1;~y2 := #in~y2; {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:49,844 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:49,845 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:49,848 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #51#return; {30#false} is VALID [2020-07-17 22:07:49,849 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {30#false} is VALID [2020-07-17 22:07:49,849 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {30#false} is VALID [2020-07-17 22:07:49,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-17 22:07:49,852 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-17 22:07:49,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054191587] [2020-07-17 22:07:49,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:49,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:07:49,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803881833] [2020-07-17 22:07:49,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-17 22:07:49,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:49,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:07:49,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:49,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:07:49,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:07:49,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:07:49,914 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2020-07-17 22:07:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:50,257 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-17 22:07:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:07:50,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-17 22:07:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:07:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-17 22:07:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:07:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-17 22:07:50,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-17 22:07:50,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:50,390 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:07:50,391 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:07:50,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:07:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:07:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:07:50,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:50,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:07:50,448 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:07:50,448 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:07:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:50,455 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-17 22:07:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-17 22:07:50,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:50,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:50,457 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:07:50,458 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:07:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:50,463 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-17 22:07:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-17 22:07:50,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:50,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:50,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:50,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:07:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-17 22:07:50,471 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2020-07-17 22:07:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:50,472 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-17 22:07:50,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:07:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-17 22:07:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:07:50,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:50,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:50,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:07:50,475 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:50,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:50,475 INFO L82 PathProgramCache]: Analyzing trace with hash -423841111, now seen corresponding path program 1 times [2020-07-17 22:07:50,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:50,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736199793] [2020-07-17 22:07:50,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:50,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} assume true; {173#true} is VALID [2020-07-17 22:07:50,556 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {173#true} {173#true} #47#return; {173#true} is VALID [2020-07-17 22:07:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:50,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} ~y1 := #in~y1;~y2 := #in~y2; {173#true} is VALID [2020-07-17 22:07:50,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} assume !(~y1 <= 0 || ~y2 <= 0); {184#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:50,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:50,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {185#(<= 1 |gcd_#res|)} assume true; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:50,611 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {185#(<= 1 |gcd_#res|)} {173#true} #51#return; {182#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:50,611 INFO L263 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2020-07-17 22:07:50,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2020-07-17 22:07:50,612 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #47#return; {173#true} is VALID [2020-07-17 22:07:50,613 INFO L263 TraceCheckUtils]: 3: Hoare triple {173#true} call #t~ret5 := main(); {173#true} is VALID [2020-07-17 22:07:50,614 INFO L280 TraceCheckUtils]: 4: Hoare triple {173#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {173#true} is VALID [2020-07-17 22:07:50,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {173#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {173#true} is VALID [2020-07-17 22:07:50,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {173#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {173#true} is VALID [2020-07-17 22:07:50,615 INFO L263 TraceCheckUtils]: 7: Hoare triple {173#true} call #t~ret4 := gcd(~m~0, ~n~0); {173#true} is VALID [2020-07-17 22:07:50,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {173#true} ~y1 := #in~y1;~y2 := #in~y2; {173#true} is VALID [2020-07-17 22:07:50,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#true} assume !(~y1 <= 0 || ~y2 <= 0); {184#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:50,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:50,619 INFO L280 TraceCheckUtils]: 11: Hoare triple {185#(<= 1 |gcd_#res|)} assume true; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:50,620 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {185#(<= 1 |gcd_#res|)} {173#true} #51#return; {182#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:50,622 INFO L280 TraceCheckUtils]: 13: Hoare triple {182#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {183#(<= 1 main_~z~0)} is VALID [2020-07-17 22:07:50,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {183#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {174#false} is VALID [2020-07-17 22:07:50,623 INFO L280 TraceCheckUtils]: 15: Hoare triple {174#false} assume !false; {174#false} is VALID [2020-07-17 22:07:50,625 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-17 22:07:50,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736199793] [2020-07-17 22:07:50,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:50,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:07:50,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656269967] [2020-07-17 22:07:50,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:07:50,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:50,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:07:50,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:50,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:07:50,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:50,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:07:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:07:50,659 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2020-07-17 22:07:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:50,858 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-17 22:07:50,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:07:50,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:07:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:07:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-17 22:07:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:07:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-17 22:07:50,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-17 22:07:50,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:50,929 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:07:50,929 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:07:50,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:07:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:07:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-17 22:07:51,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:51,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-17 22:07:51,015 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-17 22:07:51,015 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-17 22:07:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:51,020 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-17 22:07:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-17 22:07:51,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:51,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:51,021 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-17 22:07:51,021 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-17 22:07:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:51,029 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-17 22:07:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-17 22:07:51,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:51,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:51,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:51,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:07:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-17 22:07:51,036 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-07-17 22:07:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:51,039 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-17 22:07:51,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:07:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-17 22:07:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:07:51,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:51,043 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:51,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:07:51,044 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:51,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1280495258, now seen corresponding path program 1 times [2020-07-17 22:07:51,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:51,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389911611] [2020-07-17 22:07:51,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-17 22:07:51,114 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {312#true} {312#true} #47#return; {312#true} is VALID [2020-07-17 22:07:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:51,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #43#return; {313#false} is VALID [2020-07-17 22:07:51,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {312#true} is VALID [2020-07-17 22:07:51,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(~y1 <= 0 || ~y2 <= 0); {328#(<= 1 gcd_~y2)} is VALID [2020-07-17 22:07:51,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {328#(<= 1 gcd_~y2)} is VALID [2020-07-17 22:07:51,211 INFO L280 TraceCheckUtils]: 3: Hoare triple {328#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID [2020-07-17 22:07:51,212 INFO L263 TraceCheckUtils]: 4: Hoare triple {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {312#true} is VALID [2020-07-17 22:07:51,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:51,213 INFO L280 TraceCheckUtils]: 6: Hoare triple {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,214 INFO L280 TraceCheckUtils]: 7: Hoare triple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,216 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #43#return; {313#false} is VALID [2020-07-17 22:07:51,216 INFO L280 TraceCheckUtils]: 9: Hoare triple {313#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {313#false} is VALID [2020-07-17 22:07:51,216 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#false} assume true; {313#false} is VALID [2020-07-17 22:07:51,217 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {313#false} {312#true} #51#return; {313#false} is VALID [2020-07-17 22:07:51,217 INFO L263 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {312#true} is VALID [2020-07-17 22:07:51,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-17 22:07:51,218 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {312#true} {312#true} #47#return; {312#true} is VALID [2020-07-17 22:07:51,218 INFO L263 TraceCheckUtils]: 3: Hoare triple {312#true} call #t~ret5 := main(); {312#true} is VALID [2020-07-17 22:07:51,219 INFO L280 TraceCheckUtils]: 4: Hoare triple {312#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {312#true} is VALID [2020-07-17 22:07:51,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {312#true} is VALID [2020-07-17 22:07:51,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {312#true} is VALID [2020-07-17 22:07:51,220 INFO L263 TraceCheckUtils]: 7: Hoare triple {312#true} call #t~ret4 := gcd(~m~0, ~n~0); {312#true} is VALID [2020-07-17 22:07:51,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {312#true} is VALID [2020-07-17 22:07:51,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(~y1 <= 0 || ~y2 <= 0); {328#(<= 1 gcd_~y2)} is VALID [2020-07-17 22:07:51,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {328#(<= 1 gcd_~y2)} is VALID [2020-07-17 22:07:51,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID [2020-07-17 22:07:51,223 INFO L263 TraceCheckUtils]: 12: Hoare triple {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {312#true} is VALID [2020-07-17 22:07:51,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:51,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,226 INFO L280 TraceCheckUtils]: 15: Hoare triple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,227 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #43#return; {313#false} is VALID [2020-07-17 22:07:51,228 INFO L280 TraceCheckUtils]: 17: Hoare triple {313#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {313#false} is VALID [2020-07-17 22:07:51,228 INFO L280 TraceCheckUtils]: 18: Hoare triple {313#false} assume true; {313#false} is VALID [2020-07-17 22:07:51,228 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {313#false} {312#true} #51#return; {313#false} is VALID [2020-07-17 22:07:51,229 INFO L280 TraceCheckUtils]: 20: Hoare triple {313#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {313#false} is VALID [2020-07-17 22:07:51,229 INFO L280 TraceCheckUtils]: 21: Hoare triple {313#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {313#false} is VALID [2020-07-17 22:07:51,229 INFO L280 TraceCheckUtils]: 22: Hoare triple {313#false} assume !false; {313#false} is VALID [2020-07-17 22:07:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:07:51,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389911611] [2020-07-17 22:07:51,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:51,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:07:51,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624476662] [2020-07-17 22:07:51,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:07:51,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:51,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:07:51,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:51,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:07:51,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:07:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:07:51,261 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2020-07-17 22:07:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:51,588 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-17 22:07:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:07:51,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:07:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:07:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-17 22:07:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:07:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-17 22:07:51,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-17 22:07:51,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:51,656 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:07:51,657 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:07:51,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:07:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:07:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-17 22:07:51,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:51,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-17 22:07:51,672 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-17 22:07:51,672 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-17 22:07:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:51,676 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-17 22:07:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-17 22:07:51,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:51,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:51,678 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-17 22:07:51,678 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-17 22:07:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:51,682 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-17 22:07:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-17 22:07:51,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:51,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:51,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:51,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:07:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-17 22:07:51,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2020-07-17 22:07:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:51,688 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-17 22:07:51,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:07:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-17 22:07:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:07:51,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:51,690 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:51,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:07:51,690 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712292, now seen corresponding path program 1 times [2020-07-17 22:07:51,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:51,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599120761] [2020-07-17 22:07:51,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-17 22:07:51,725 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {478#true} {478#true} #47#return; {478#true} is VALID [2020-07-17 22:07:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:51,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:51,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,837 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #45#return; {479#false} is VALID [2020-07-17 22:07:51,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {478#true} is VALID [2020-07-17 22:07:51,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume !(~y1 <= 0 || ~y2 <= 0); {494#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:51,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {494#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID [2020-07-17 22:07:51,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID [2020-07-17 22:07:51,842 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {478#true} is VALID [2020-07-17 22:07:51,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:51,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,846 INFO L280 TraceCheckUtils]: 7: Hoare triple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,848 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #45#return; {479#false} is VALID [2020-07-17 22:07:51,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {479#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {479#false} is VALID [2020-07-17 22:07:51,848 INFO L280 TraceCheckUtils]: 10: Hoare triple {479#false} assume true; {479#false} is VALID [2020-07-17 22:07:51,849 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {479#false} {478#true} #51#return; {479#false} is VALID [2020-07-17 22:07:51,849 INFO L263 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2020-07-17 22:07:51,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-17 22:07:51,850 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #47#return; {478#true} is VALID [2020-07-17 22:07:51,850 INFO L263 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret5 := main(); {478#true} is VALID [2020-07-17 22:07:51,851 INFO L280 TraceCheckUtils]: 4: Hoare triple {478#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {478#true} is VALID [2020-07-17 22:07:51,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {478#true} is VALID [2020-07-17 22:07:51,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {478#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {478#true} is VALID [2020-07-17 22:07:51,851 INFO L263 TraceCheckUtils]: 7: Hoare triple {478#true} call #t~ret4 := gcd(~m~0, ~n~0); {478#true} is VALID [2020-07-17 22:07:51,852 INFO L280 TraceCheckUtils]: 8: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {478#true} is VALID [2020-07-17 22:07:51,853 INFO L280 TraceCheckUtils]: 9: Hoare triple {478#true} assume !(~y1 <= 0 || ~y2 <= 0); {494#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:51,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {494#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID [2020-07-17 22:07:51,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID [2020-07-17 22:07:51,855 INFO L263 TraceCheckUtils]: 12: Hoare triple {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {478#true} is VALID [2020-07-17 22:07:51,856 INFO L280 TraceCheckUtils]: 13: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-17 22:07:51,857 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,858 INFO L280 TraceCheckUtils]: 15: Hoare triple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-17 22:07:51,860 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #45#return; {479#false} is VALID [2020-07-17 22:07:51,861 INFO L280 TraceCheckUtils]: 17: Hoare triple {479#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {479#false} is VALID [2020-07-17 22:07:51,861 INFO L280 TraceCheckUtils]: 18: Hoare triple {479#false} assume true; {479#false} is VALID [2020-07-17 22:07:51,862 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {479#false} {478#true} #51#return; {479#false} is VALID [2020-07-17 22:07:51,862 INFO L280 TraceCheckUtils]: 20: Hoare triple {479#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {479#false} is VALID [2020-07-17 22:07:51,862 INFO L280 TraceCheckUtils]: 21: Hoare triple {479#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {479#false} is VALID [2020-07-17 22:07:51,862 INFO L280 TraceCheckUtils]: 22: Hoare triple {479#false} assume !false; {479#false} is VALID [2020-07-17 22:07:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:07:51,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599120761] [2020-07-17 22:07:51,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:51,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:07:51,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536593339] [2020-07-17 22:07:51,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:07:51,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:51,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:07:51,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:51,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:07:51,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:07:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:07:51,901 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2020-07-17 22:07:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:52,318 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-17 22:07:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:07:52,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:07:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:07:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-17 22:07:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:07:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-17 22:07:52,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-17 22:07:52,401 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-17 22:07:52,404 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:07:52,404 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:07:52,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:07:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:07:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-17 22:07:52,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:52,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-17 22:07:52,427 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-17 22:07:52,427 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-17 22:07:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:52,433 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-17 22:07:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-17 22:07:52,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:52,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:52,434 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-17 22:07:52,435 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-17 22:07:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:52,443 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-17 22:07:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-17 22:07:52,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:52,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:52,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:52,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:07:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-17 22:07:52,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2020-07-17 22:07:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:52,449 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-17 22:07:52,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:07:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-17 22:07:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:07:52,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:52,452 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] [2020-07-17 22:07:52,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:07:52,453 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1139697511, now seen corresponding path program 1 times [2020-07-17 22:07:52,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:52,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743335637] [2020-07-17 22:07:52,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:52,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} assume true; {641#true} is VALID [2020-07-17 22:07:52,553 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {641#true} {641#true} #47#return; {641#true} is VALID [2020-07-17 22:07:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:52,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-17 22:07:52,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:52,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,643 INFO L280 TraceCheckUtils]: 3: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,645 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:52,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-17 22:07:52,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {641#true} is VALID [2020-07-17 22:07:52,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {641#true} assume !(~y1 == ~y2); {641#true} is VALID [2020-07-17 22:07:52,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {641#true} assume ~y1 > ~y2; {641#true} is VALID [2020-07-17 22:07:52,646 INFO L263 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {641#true} is VALID [2020-07-17 22:07:52,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-17 22:07:52,647 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:52,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,651 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:52,652 INFO L280 TraceCheckUtils]: 10: Hoare triple {665#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,653 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #51#return; {658#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:52,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2020-07-17 22:07:52,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume true; {641#true} is VALID [2020-07-17 22:07:52,654 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {641#true} {641#true} #47#return; {641#true} is VALID [2020-07-17 22:07:52,654 INFO L263 TraceCheckUtils]: 3: Hoare triple {641#true} call #t~ret5 := main(); {641#true} is VALID [2020-07-17 22:07:52,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {641#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {641#true} is VALID [2020-07-17 22:07:52,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {641#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {641#true} is VALID [2020-07-17 22:07:52,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {641#true} is VALID [2020-07-17 22:07:52,655 INFO L263 TraceCheckUtils]: 7: Hoare triple {641#true} call #t~ret4 := gcd(~m~0, ~n~0); {641#true} is VALID [2020-07-17 22:07:52,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-17 22:07:52,655 INFO L280 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {641#true} is VALID [2020-07-17 22:07:52,656 INFO L280 TraceCheckUtils]: 10: Hoare triple {641#true} assume !(~y1 == ~y2); {641#true} is VALID [2020-07-17 22:07:52,656 INFO L280 TraceCheckUtils]: 11: Hoare triple {641#true} assume ~y1 > ~y2; {641#true} is VALID [2020-07-17 22:07:52,656 INFO L263 TraceCheckUtils]: 12: Hoare triple {641#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {641#true} is VALID [2020-07-17 22:07:52,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-17 22:07:52,657 INFO L280 TraceCheckUtils]: 14: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:52,657 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,658 INFO L280 TraceCheckUtils]: 16: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,659 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:52,659 INFO L280 TraceCheckUtils]: 18: Hoare triple {665#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:52,660 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #51#return; {658#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:52,661 INFO L280 TraceCheckUtils]: 21: Hoare triple {658#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {659#(<= 1 main_~z~0)} is VALID [2020-07-17 22:07:52,661 INFO L280 TraceCheckUtils]: 22: Hoare triple {659#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {642#false} is VALID [2020-07-17 22:07:52,662 INFO L280 TraceCheckUtils]: 23: Hoare triple {642#false} assume !false; {642#false} is VALID [2020-07-17 22:07:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:07:52,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743335637] [2020-07-17 22:07:52,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:52,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:07:52,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776683158] [2020-07-17 22:07:52,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:07:52,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:52,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:07:52,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:52,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:07:52,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:52,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:07:52,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:07:52,694 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2020-07-17 22:07:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:52,891 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-17 22:07:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:07:52,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:07:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:07:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:07:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:07:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:07:52,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-17 22:07:52,944 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-17 22:07:52,946 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:07:52,946 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:07:52,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:07:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:07:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-17 22:07:52,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:52,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-17 22:07:52,960 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-17 22:07:52,960 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-17 22:07:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:52,963 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-17 22:07:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-17 22:07:52,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:52,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:52,964 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-17 22:07:52,964 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-17 22:07:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:52,967 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-17 22:07:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-17 22:07:52,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:52,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:52,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:52,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:07:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-17 22:07:52,970 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2020-07-17 22:07:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:52,971 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-17 22:07:52,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:07:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-17 22:07:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:07:52,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:52,972 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] [2020-07-17 22:07:52,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:07:52,972 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash 99153721, now seen corresponding path program 1 times [2020-07-17 22:07:52,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:52,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687431102] [2020-07-17 22:07:52,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} assume true; {800#true} is VALID [2020-07-17 22:07:53,015 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {800#true} {800#true} #47#return; {800#true} is VALID [2020-07-17 22:07:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-17 22:07:53,073 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,074 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,075 INFO L280 TraceCheckUtils]: 3: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,076 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {826#(<= 1 |gcd_#res|)} {819#(<= 1 gcd_~y1)} #45#return; {825#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-17 22:07:53,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-17 22:07:53,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,079 INFO L280 TraceCheckUtils]: 3: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,079 INFO L263 TraceCheckUtils]: 4: Hoare triple {819#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {800#true} is VALID [2020-07-17 22:07:53,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-17 22:07:53,080 INFO L280 TraceCheckUtils]: 6: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,081 INFO L280 TraceCheckUtils]: 7: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,081 INFO L280 TraceCheckUtils]: 8: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,082 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {826#(<= 1 |gcd_#res|)} {819#(<= 1 gcd_~y1)} #45#return; {825#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-17 22:07:53,084 INFO L280 TraceCheckUtils]: 10: Hoare triple {825#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,090 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {826#(<= 1 |gcd_#res|)} {800#true} #51#return; {817#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:53,091 INFO L263 TraceCheckUtils]: 0: Hoare triple {800#true} call ULTIMATE.init(); {800#true} is VALID [2020-07-17 22:07:53,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume true; {800#true} is VALID [2020-07-17 22:07:53,092 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {800#true} {800#true} #47#return; {800#true} is VALID [2020-07-17 22:07:53,092 INFO L263 TraceCheckUtils]: 3: Hoare triple {800#true} call #t~ret5 := main(); {800#true} is VALID [2020-07-17 22:07:53,092 INFO L280 TraceCheckUtils]: 4: Hoare triple {800#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {800#true} is VALID [2020-07-17 22:07:53,092 INFO L280 TraceCheckUtils]: 5: Hoare triple {800#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {800#true} is VALID [2020-07-17 22:07:53,093 INFO L280 TraceCheckUtils]: 6: Hoare triple {800#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {800#true} is VALID [2020-07-17 22:07:53,093 INFO L263 TraceCheckUtils]: 7: Hoare triple {800#true} call #t~ret4 := gcd(~m~0, ~n~0); {800#true} is VALID [2020-07-17 22:07:53,093 INFO L280 TraceCheckUtils]: 8: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-17 22:07:53,094 INFO L280 TraceCheckUtils]: 9: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,095 INFO L280 TraceCheckUtils]: 10: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,096 INFO L280 TraceCheckUtils]: 11: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,097 INFO L263 TraceCheckUtils]: 12: Hoare triple {819#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {800#true} is VALID [2020-07-17 22:07:53,097 INFO L280 TraceCheckUtils]: 13: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-17 22:07:53,098 INFO L280 TraceCheckUtils]: 14: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,099 INFO L280 TraceCheckUtils]: 15: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,100 INFO L280 TraceCheckUtils]: 16: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,101 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {826#(<= 1 |gcd_#res|)} {819#(<= 1 gcd_~y1)} #45#return; {825#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-17 22:07:53,102 INFO L280 TraceCheckUtils]: 18: Hoare triple {825#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,105 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {826#(<= 1 |gcd_#res|)} {800#true} #51#return; {817#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:53,106 INFO L280 TraceCheckUtils]: 21: Hoare triple {817#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {818#(<= 1 main_~z~0)} is VALID [2020-07-17 22:07:53,107 INFO L280 TraceCheckUtils]: 22: Hoare triple {818#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {801#false} is VALID [2020-07-17 22:07:53,107 INFO L280 TraceCheckUtils]: 23: Hoare triple {801#false} assume !false; {801#false} is VALID [2020-07-17 22:07:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:07:53,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687431102] [2020-07-17 22:07:53,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:53,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:07:53,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972829368] [2020-07-17 22:07:53,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:07:53,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:53,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:07:53,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:53,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:07:53,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:07:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:07:53,139 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2020-07-17 22:07:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:53,320 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-17 22:07:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:07:53,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:07:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:07:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:07:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:07:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:07:53,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-17 22:07:53,363 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-17 22:07:53,365 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:07:53,365 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:07:53,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:07:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:07:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:07:53,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:53,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:07:53,379 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:07:53,379 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:07:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:53,382 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-17 22:07:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-17 22:07:53,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:53,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:53,383 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:07:53,384 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:07:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:53,386 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-17 22:07:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-17 22:07:53,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:53,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:53,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:53,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:07:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-07-17 22:07:53,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2020-07-17 22:07:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:53,390 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-07-17 22:07:53,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:07:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-17 22:07:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:07:53,391 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:53,391 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:07:53,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:07:53,392 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 10057033, now seen corresponding path program 1 times [2020-07-17 22:07:53,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:53,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042169834] [2020-07-17 22:07:53,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} assume true; {973#true} is VALID [2020-07-17 22:07:53,467 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {973#true} {973#true} #47#return; {973#true} is VALID [2020-07-17 22:07:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:53,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,574 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:53,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-17 22:07:53,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-17 22:07:53,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-17 22:07:53,576 INFO L263 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-17 22:07:53,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,580 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:53,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {1020#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,581 INFO L280 TraceCheckUtils]: 11: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,582 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-17 22:07:53,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-17 22:07:53,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-17 22:07:53,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {973#true} assume !(~y1 > ~y2); {973#true} is VALID [2020-07-17 22:07:53,584 INFO L263 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {973#true} is VALID [2020-07-17 22:07:53,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,584 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-17 22:07:53,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-17 22:07:53,585 INFO L280 TraceCheckUtils]: 8: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-17 22:07:53,585 INFO L263 TraceCheckUtils]: 9: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-17 22:07:53,585 INFO L280 TraceCheckUtils]: 10: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,586 INFO L280 TraceCheckUtils]: 11: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,587 INFO L280 TraceCheckUtils]: 12: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,587 INFO L280 TraceCheckUtils]: 13: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,589 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:53,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {1020#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,590 INFO L280 TraceCheckUtils]: 16: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,591 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-17 22:07:53,592 INFO L280 TraceCheckUtils]: 18: Hoare triple {1013#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,593 INFO L280 TraceCheckUtils]: 19: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,594 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #51#return; {998#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:53,595 INFO L263 TraceCheckUtils]: 0: Hoare triple {973#true} call ULTIMATE.init(); {973#true} is VALID [2020-07-17 22:07:53,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume true; {973#true} is VALID [2020-07-17 22:07:53,595 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {973#true} {973#true} #47#return; {973#true} is VALID [2020-07-17 22:07:53,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {973#true} call #t~ret5 := main(); {973#true} is VALID [2020-07-17 22:07:53,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {973#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {973#true} is VALID [2020-07-17 22:07:53,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {973#true} is VALID [2020-07-17 22:07:53,596 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {973#true} is VALID [2020-07-17 22:07:53,596 INFO L263 TraceCheckUtils]: 7: Hoare triple {973#true} call #t~ret4 := gcd(~m~0, ~n~0); {973#true} is VALID [2020-07-17 22:07:53,597 INFO L280 TraceCheckUtils]: 8: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-17 22:07:53,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-17 22:07:53,597 INFO L280 TraceCheckUtils]: 11: Hoare triple {973#true} assume !(~y1 > ~y2); {973#true} is VALID [2020-07-17 22:07:53,598 INFO L263 TraceCheckUtils]: 12: Hoare triple {973#true} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {973#true} is VALID [2020-07-17 22:07:53,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,598 INFO L280 TraceCheckUtils]: 14: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-17 22:07:53,598 INFO L280 TraceCheckUtils]: 15: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-17 22:07:53,599 INFO L280 TraceCheckUtils]: 16: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-17 22:07:53,599 INFO L263 TraceCheckUtils]: 17: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-17 22:07:53,599 INFO L280 TraceCheckUtils]: 18: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-17 22:07:53,600 INFO L280 TraceCheckUtils]: 19: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-17 22:07:53,600 INFO L280 TraceCheckUtils]: 20: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,601 INFO L280 TraceCheckUtils]: 21: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,602 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-17 22:07:53,603 INFO L280 TraceCheckUtils]: 23: Hoare triple {1020#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,604 INFO L280 TraceCheckUtils]: 24: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,605 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-17 22:07:53,605 INFO L280 TraceCheckUtils]: 26: Hoare triple {1013#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,606 INFO L280 TraceCheckUtils]: 27: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-17 22:07:53,607 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #51#return; {998#(<= 1 |main_#t~ret4|)} is VALID [2020-07-17 22:07:53,608 INFO L280 TraceCheckUtils]: 29: Hoare triple {998#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {999#(<= 1 main_~z~0)} is VALID [2020-07-17 22:07:53,608 INFO L280 TraceCheckUtils]: 30: Hoare triple {999#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {974#false} is VALID [2020-07-17 22:07:53,609 INFO L280 TraceCheckUtils]: 31: Hoare triple {974#false} assume !false; {974#false} is VALID [2020-07-17 22:07:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-17 22:07:53,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042169834] [2020-07-17 22:07:53,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:53,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:07:53,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407784440] [2020-07-17 22:07:53,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-17 22:07:53,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:53,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:07:53,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:53,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:07:53,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:07:53,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:07:53,640 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2020-07-17 22:07:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:53,843 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-17 22:07:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:07:53,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-17 22:07:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:07:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-17 22:07:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:07:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-17 22:07:53,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-17 22:07:53,880 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-17 22:07:53,881 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:07:53,881 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:07:53,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:07:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:07:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:07:53,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:53,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:53,883 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:53,884 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:53,884 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:07:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:07:53,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:53,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:53,885 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:53,885 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:53,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:07:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:07:53,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:53,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:53,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:53,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:07:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:07:53,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-07-17 22:07:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:53,887 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:07:53,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:07:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:07:53,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:53,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:07:53,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:07:53,985 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:07:53,985 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:07:53,986 INFO L268 CegarLoopResult]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2020-07-17 22:07:53,986 INFO L268 CegarLoopResult]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2020-07-17 22:07:53,986 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-17 22:07:53,986 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-17 22:07:53,987 INFO L271 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2020-07-17 22:07:53,987 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-17 22:07:53,987 INFO L268 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-07-17 22:07:53,987 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-17 22:07:53,987 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-17 22:07:53,987 INFO L268 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-07-17 22:07:53,988 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:07:53,988 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:07:53,988 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:07:53,988 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:07:53,988 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-17 22:07:53,988 INFO L268 CegarLoopResult]: For program point L30(lines 30 32) no Hoare annotation was computed. [2020-07-17 22:07:53,989 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2020-07-17 22:07:53,989 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 28 43) no Hoare annotation was computed. [2020-07-17 22:07:53,989 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-17 22:07:53,989 INFO L268 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2020-07-17 22:07:53,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-17 22:07:53,990 INFO L268 CegarLoopResult]: For program point L38-1(lines 28 43) no Hoare annotation was computed. [2020-07-17 22:07:53,990 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-17 22:07:53,990 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-17 22:07:53,995 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:07:53,995 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:07:53,996 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:07:53,996 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:07:53,996 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:07:53,996 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:07:53,996 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:07:53,996 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: gcdFINAL has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:07:53,997 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:07:53,998 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:07:53,999 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:07:53,999 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-17 22:07:53,999 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:07:53,999 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:07:53,999 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-17 22:07:53,999 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:07:54,000 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:07:54,000 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:07:54,000 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:07:54,000 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:07:54,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:07:54 BoogieIcfgContainer [2020-07-17 22:07:54,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:07:54,007 INFO L168 Benchmark]: Toolchain (without parser) took 5569.65 ms. Allocated memory was 135.8 MB in the beginning and 297.8 MB in the end (delta: 162.0 MB). Free memory was 98.4 MB in the beginning and 197.2 MB in the end (delta: -98.7 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:54,007 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory is still 116.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:07:54,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.80 ms. Allocated memory is still 135.8 MB. Free memory was 98.0 MB in the beginning and 88.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:54,009 INFO L168 Benchmark]: Boogie Preprocessor took 148.61 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 88.1 MB in the beginning and 178.1 MB in the end (delta: -89.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:54,010 INFO L168 Benchmark]: RCFGBuilder took 445.70 ms. Allocated memory is still 199.8 MB. Free memory was 178.1 MB in the beginning and 157.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:54,010 INFO L168 Benchmark]: TraceAbstraction took 4664.96 ms. Allocated memory was 199.8 MB in the beginning and 297.8 MB in the end (delta: 98.0 MB). Free memory was 157.7 MB in the beginning and 197.2 MB in the end (delta: -39.5 MB). Peak memory consumption was 58.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:54,013 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.22 ms. Allocated memory is still 135.8 MB. Free memory is still 116.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.80 ms. Allocated memory is still 135.8 MB. Free memory was 98.0 MB in the beginning and 88.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.61 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 88.1 MB in the beginning and 178.1 MB in the end (delta: -89.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 445.70 ms. Allocated memory is still 199.8 MB. Free memory was 178.1 MB in the beginning and 157.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4664.96 ms. Allocated memory was 199.8 MB in the beginning and 297.8 MB in the end (delta: 98.0 MB). Free memory was 157.7 MB in the beginning and 197.2 MB in the end (delta: -39.5 MB). Peak memory consumption was 58.6 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 142 SDtfs, 89 SDslu, 488 SDs, 0 SdLazy, 281 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 14 NumberOfFragments, 40 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 6864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 34/34 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...