/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-8fc6572 [2020-07-10 14:44:08,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:44:08,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:44:08,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:44:08,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:44:08,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:44:08,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:44:08,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:44:08,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:44:08,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:44:08,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:44:08,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:44:08,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:44:08,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:44:08,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:44:08,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:44:08,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:44:08,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:44:08,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:44:08,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:44:08,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:44:08,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:44:08,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:44:08,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:44:08,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:44:08,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:44:08,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:44:08,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:44:08,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:44:08,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:44:08,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:44:08,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:44:08,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:44:08,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:44:08,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:44:08,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:44:08,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:44:08,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:44:08,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:44:08,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:44:08,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:44:08,719 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-10 14:44:08,756 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:44:08,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:44:08,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:44:08,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:44:08,762 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:44:08,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:44:08,763 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:44:08,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:44:08,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:44:08,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:44:08,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:44:08,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:44:08,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:44:08,764 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:44:08,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:44:08,764 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:44:08,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:44:08,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:44:08,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:44:08,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:44:08,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:44:08,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:44:08,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:44:08,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:44:08,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:44:08,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:44:08,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:44:08,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:44:08,769 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:44:08,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:44:09,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:44:09,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:44:09,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:44:09,089 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:44:09,090 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:44:09,091 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-10 14:44:09,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/224ef82c4/c384ec460a244250bb2718ce20768be1/FLAG511b2cb39 [2020-07-10 14:44:09,621 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:44:09,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-10 14:44:09,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/224ef82c4/c384ec460a244250bb2718ce20768be1/FLAG511b2cb39 [2020-07-10 14:44:10,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/224ef82c4/c384ec460a244250bb2718ce20768be1 [2020-07-10 14:44:10,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:44:10,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:44:10,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:10,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:44:10,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:44:10,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47941ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10, skipping insertion in model container [2020-07-10 14:44:10,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:44:10,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:44:10,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:10,272 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:44:10,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:10,320 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:44:10,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10 WrapperNode [2020-07-10 14:44:10,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:10,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:44:10,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:44:10,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:44:10,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (1/1) ... [2020-07-10 14:44:10,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:44:10,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:44:10,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:44:10,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:44:10,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (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-10 14:44:10,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:44:10,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:44:10,517 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2020-07-10 14:44:10,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:44:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:44:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:44:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2020-07-10 14:44:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:44:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:44:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:44:10,922 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:44:10,923 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:44:10,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:10 BoogieIcfgContainer [2020-07-10 14:44:10,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:44:10,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:44:10,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:44:10,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:44:10,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:44:10" (1/3) ... [2020-07-10 14:44:10,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9b2686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:10, skipping insertion in model container [2020-07-10 14:44:10,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:10" (2/3) ... [2020-07-10 14:44:10,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9b2686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:10, skipping insertion in model container [2020-07-10 14:44:10,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:10" (3/3) ... [2020-07-10 14:44:10,936 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2020-07-10 14:44:10,947 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:44:10,955 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:44:10,970 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:44:10,995 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:44:10,996 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:44:10,996 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:44:10,996 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:44:10,998 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:44:10,998 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:44:10,998 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:44:10,998 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:44:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-10 14:44:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 14:44:11,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:11,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:11,027 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1001932622, now seen corresponding path program 1 times [2020-07-10 14:44:11,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:11,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286494331] [2020-07-10 14:44:11,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:11,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:44:11,292 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2020-07-10 14:44:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:11,387 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-10 14:44:11,389 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-10 14:44:11,391 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-10 14:44:11,393 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-10 14:44:11,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-10 14:44:11,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:44:11,395 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2020-07-10 14:44:11,396 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2020-07-10 14:44:11,396 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-10 14:44:11,398 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-10 14:44:11,401 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-10 14:44:11,401 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-10 14:44:11,402 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-10 14:44:11,404 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-10 14:44:11,406 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-10 14:44:11,410 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-10 14:44:11,411 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-10 14:44:11,411 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {30#false} is VALID [2020-07-10 14:44:11,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-10 14:44:11,414 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-10 14:44:11,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286494331] [2020-07-10 14:44:11,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:11,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:44:11,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581269455] [2020-07-10 14:44:11,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-10 14:44:11,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:11,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:44:11,475 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-10 14:44:11,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:44:11,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:44:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:44:11,490 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2020-07-10 14:44:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:11,852 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-10 14:44:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:44:11,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-10 14:44:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-10 14:44:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-10 14:44:11,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-10 14:44:11,966 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-10 14:44:11,980 INFO L225 Difference]: With dead ends: 40 [2020-07-10 14:44:11,980 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 14:44:11,984 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-10 14:44:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 14:44:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 14:44:12,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:12,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 14:44:12,064 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:44:12,064 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:44:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:12,076 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-10 14:44:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:44:12,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:12,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:12,078 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:44:12,079 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:44:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:12,096 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-10 14:44:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:44:12,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:12,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:12,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:12,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:44:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-10 14:44:12,110 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2020-07-10 14:44:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:12,111 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-10 14:44:12,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:44:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:44:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 14:44:12,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:12,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:12,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:44:12,115 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:12,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:12,115 INFO L82 PathProgramCache]: Analyzing trace with hash -423841111, now seen corresponding path program 1 times [2020-07-10 14:44:12,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:12,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999476776] [2020-07-10 14:44:12,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} assume true; {173#true} is VALID [2020-07-10 14:44:12,193 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {173#true} {173#true} #47#return; {173#true} is VALID [2020-07-10 14:44:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,235 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} ~y1 := #in~y1;~y2 := #in~y2; {173#true} is VALID [2020-07-10 14:44:12,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} assume !(~y1 <= 0 || ~y2 <= 0); {184#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:12,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:12,240 INFO L280 TraceCheckUtils]: 3: Hoare triple {185#(<= 1 |gcd_#res|)} assume true; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:12,242 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {185#(<= 1 |gcd_#res|)} {173#true} #51#return; {182#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:12,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2020-07-10 14:44:12,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2020-07-10 14:44:12,244 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #47#return; {173#true} is VALID [2020-07-10 14:44:12,244 INFO L263 TraceCheckUtils]: 3: Hoare triple {173#true} call #t~ret5 := main(); {173#true} is VALID [2020-07-10 14:44:12,244 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-10 14:44:12,245 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-10 14:44:12,245 INFO L280 TraceCheckUtils]: 6: Hoare triple {173#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {173#true} is VALID [2020-07-10 14:44:12,245 INFO L263 TraceCheckUtils]: 7: Hoare triple {173#true} call #t~ret4 := gcd(~m~0, ~n~0); {173#true} is VALID [2020-07-10 14:44:12,246 INFO L280 TraceCheckUtils]: 8: Hoare triple {173#true} ~y1 := #in~y1;~y2 := #in~y2; {173#true} is VALID [2020-07-10 14:44:12,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#true} assume !(~y1 <= 0 || ~y2 <= 0); {184#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:12,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:12,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {185#(<= 1 |gcd_#res|)} assume true; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:12,253 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {185#(<= 1 |gcd_#res|)} {173#true} #51#return; {182#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:12,255 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-10 14:44:12,256 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-10 14:44:12,257 INFO L280 TraceCheckUtils]: 15: Hoare triple {174#false} assume !false; {174#false} is VALID [2020-07-10 14:44:12,258 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-10 14:44:12,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999476776] [2020-07-10 14:44:12,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:12,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:44:12,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160691602] [2020-07-10 14:44:12,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 14:44:12,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:12,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:44:12,283 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-10 14:44:12,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:44:12,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:12,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:44:12,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:44:12,285 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2020-07-10 14:44:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:12,470 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 14:44:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:44:12,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 14:44:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-10 14:44:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-10 14:44:12,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-10 14:44:12,537 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-10 14:44:12,539 INFO L225 Difference]: With dead ends: 30 [2020-07-10 14:44:12,540 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 14:44:12,543 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-10 14:44:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 14:44:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-10 14:44:12,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:12,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-10 14:44:12,564 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-10 14:44:12,565 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-10 14:44:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:12,573 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:44:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:44:12,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:12,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:12,577 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-10 14:44:12,577 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-10 14:44:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:12,588 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:44:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:44:12,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:12,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:12,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:12,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:44:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-10 14:44:12,600 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-07-10 14:44:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:12,601 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-10 14:44:12,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:44:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-10 14:44:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:44:12,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:12,602 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-10 14:44:12,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:44:12,603 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1280495258, now seen corresponding path program 1 times [2020-07-10 14:44:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:12,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100214520] [2020-07-10 14:44:12,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-10 14:44:12,644 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {312#true} {312#true} #47#return; {312#true} is VALID [2020-07-10 14:44:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:12,774 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-10 14:44:12,775 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-10 14:44:12,776 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-10 14:44:12,778 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-10 14:44:12,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {312#true} is VALID [2020-07-10 14:44:12,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(~y1 <= 0 || ~y2 <= 0); {328#(<= 1 gcd_~y2)} is VALID [2020-07-10 14:44:12,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {328#(<= 1 gcd_~y2)} is VALID [2020-07-10 14:44:12,786 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-10 14:44:12,787 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-10 14:44:12,789 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-10 14:44:12,790 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-10 14:44:12,791 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-10 14:44:12,793 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-10 14:44:12,794 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-10 14:44:12,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#false} assume true; {313#false} is VALID [2020-07-10 14:44:12,794 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {313#false} {312#true} #51#return; {313#false} is VALID [2020-07-10 14:44:12,798 INFO L263 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {312#true} is VALID [2020-07-10 14:44:12,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-10 14:44:12,799 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {312#true} {312#true} #47#return; {312#true} is VALID [2020-07-10 14:44:12,799 INFO L263 TraceCheckUtils]: 3: Hoare triple {312#true} call #t~ret5 := main(); {312#true} is VALID [2020-07-10 14:44:12,800 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-10 14:44:12,800 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-10 14:44:12,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {312#true} is VALID [2020-07-10 14:44:12,801 INFO L263 TraceCheckUtils]: 7: Hoare triple {312#true} call #t~ret4 := gcd(~m~0, ~n~0); {312#true} is VALID [2020-07-10 14:44:12,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {312#true} is VALID [2020-07-10 14:44:12,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(~y1 <= 0 || ~y2 <= 0); {328#(<= 1 gcd_~y2)} is VALID [2020-07-10 14:44:12,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {328#(<= 1 gcd_~y2)} is VALID [2020-07-10 14:44:12,806 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-10 14:44:12,807 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-10 14:44:12,808 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-10 14:44:12,809 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-10 14:44:12,810 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-10 14:44:12,813 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-10 14:44:12,813 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-10 14:44:12,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {313#false} assume true; {313#false} is VALID [2020-07-10 14:44:12,814 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {313#false} {312#true} #51#return; {313#false} is VALID [2020-07-10 14:44:12,815 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-10 14:44:12,815 INFO L280 TraceCheckUtils]: 21: Hoare triple {313#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {313#false} is VALID [2020-07-10 14:44:12,816 INFO L280 TraceCheckUtils]: 22: Hoare triple {313#false} assume !false; {313#false} is VALID [2020-07-10 14:44:12,823 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-10 14:44:12,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100214520] [2020-07-10 14:44:12,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:12,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:44:12,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542611572] [2020-07-10 14:44:12,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:44:12,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:12,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:44:12,867 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-10 14:44:12,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:44:12,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:44:12,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:44:12,869 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2020-07-10 14:44:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:13,181 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-10 14:44:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:44:13,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:44:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-10 14:44:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-10 14:44:13,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-10 14:44:13,246 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-10 14:44:13,249 INFO L225 Difference]: With dead ends: 36 [2020-07-10 14:44:13,249 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 14:44:13,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:44:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 14:44:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-10 14:44:13,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:13,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-10 14:44:13,264 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-10 14:44:13,264 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-10 14:44:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:13,268 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-10 14:44:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-10 14:44:13,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:13,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:13,269 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-10 14:44:13,269 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-10 14:44:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:13,273 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-10 14:44:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-10 14:44:13,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:13,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:13,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:13,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 14:44:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-10 14:44:13,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2020-07-10 14:44:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:13,278 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-10 14:44:13,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:44:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-10 14:44:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:44:13,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:13,280 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-10 14:44:13,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:44:13,280 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:13,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712292, now seen corresponding path program 1 times [2020-07-10 14:44:13,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:13,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657039520] [2020-07-10 14:44:13,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:13,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-10 14:44:13,332 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {478#true} {478#true} #47#return; {478#true} is VALID [2020-07-10 14:44:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:13,490 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-10 14:44:13,492 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-10 14:44:13,493 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-10 14:44:13,495 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-10 14:44:13,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {478#true} is VALID [2020-07-10 14:44:13,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume !(~y1 <= 0 || ~y2 <= 0); {494#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:13,497 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-10 14:44:13,498 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-10 14:44:13,499 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-10 14:44:13,500 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-10 14:44:13,501 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-10 14:44:13,501 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-10 14:44:13,503 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-10 14:44:13,503 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-10 14:44:13,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {479#false} assume true; {479#false} is VALID [2020-07-10 14:44:13,504 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {479#false} {478#true} #51#return; {479#false} is VALID [2020-07-10 14:44:13,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2020-07-10 14:44:13,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-10 14:44:13,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #47#return; {478#true} is VALID [2020-07-10 14:44:13,506 INFO L263 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret5 := main(); {478#true} is VALID [2020-07-10 14:44:13,506 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-10 14:44:13,506 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-10 14:44:13,507 INFO L280 TraceCheckUtils]: 6: Hoare triple {478#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {478#true} is VALID [2020-07-10 14:44:13,507 INFO L263 TraceCheckUtils]: 7: Hoare triple {478#true} call #t~ret4 := gcd(~m~0, ~n~0); {478#true} is VALID [2020-07-10 14:44:13,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {478#true} is VALID [2020-07-10 14:44:13,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {478#true} assume !(~y1 <= 0 || ~y2 <= 0); {494#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:13,509 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-10 14:44:13,510 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-10 14:44:13,511 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-10 14:44:13,511 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-10 14:44:13,512 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-10 14:44:13,513 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-10 14:44:13,515 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-10 14:44:13,515 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-10 14:44:13,516 INFO L280 TraceCheckUtils]: 18: Hoare triple {479#false} assume true; {479#false} is VALID [2020-07-10 14:44:13,516 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {479#false} {478#true} #51#return; {479#false} is VALID [2020-07-10 14:44:13,516 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-10 14:44:13,516 INFO L280 TraceCheckUtils]: 21: Hoare triple {479#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {479#false} is VALID [2020-07-10 14:44:13,517 INFO L280 TraceCheckUtils]: 22: Hoare triple {479#false} assume !false; {479#false} is VALID [2020-07-10 14:44:13,518 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-10 14:44:13,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657039520] [2020-07-10 14:44:13,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:13,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:44:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205132253] [2020-07-10 14:44:13,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-10 14:44:13,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:13,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:44:13,546 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-10 14:44:13,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:44:13,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:44:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:44:13,547 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2020-07-10 14:44:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:13,934 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-10 14:44:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:44:13,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-10 14:44:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-10 14:44:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-10 14:44:13,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-10 14:44:13,999 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-10 14:44:14,001 INFO L225 Difference]: With dead ends: 36 [2020-07-10 14:44:14,002 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 14:44:14,003 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-10 14:44:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 14:44:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-10 14:44:14,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:14,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-10 14:44:14,019 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-10 14:44:14,019 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-10 14:44:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:14,022 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:44:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:44:14,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:14,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:14,023 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-10 14:44:14,024 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-10 14:44:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:14,026 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-10 14:44:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:44:14,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:14,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:14,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:14,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:44:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 14:44:14,030 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2020-07-10 14:44:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:14,030 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 14:44:14,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:44:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 14:44:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 14:44:14,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:14,032 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-10 14:44:14,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:44:14,032 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1139697511, now seen corresponding path program 1 times [2020-07-10 14:44:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:14,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090127065] [2020-07-10 14:44:14,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} assume true; {641#true} is VALID [2020-07-10 14:44:14,108 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {641#true} {641#true} #47#return; {641#true} is VALID [2020-07-10 14:44:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-10 14:44:14,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,214 INFO L280 TraceCheckUtils]: 3: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,216 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:14,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-10 14:44:14,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {641#true} is VALID [2020-07-10 14:44:14,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {641#true} assume !(~y1 == ~y2); {641#true} is VALID [2020-07-10 14:44:14,217 INFO L280 TraceCheckUtils]: 3: Hoare triple {641#true} assume ~y1 > ~y2; {641#true} is VALID [2020-07-10 14:44:14,217 INFO L263 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {641#true} is VALID [2020-07-10 14:44:14,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-10 14:44:14,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,225 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:14,226 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-10 14:44:14,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,228 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #51#return; {658#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:14,228 INFO L263 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2020-07-10 14:44:14,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume true; {641#true} is VALID [2020-07-10 14:44:14,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {641#true} {641#true} #47#return; {641#true} is VALID [2020-07-10 14:44:14,229 INFO L263 TraceCheckUtils]: 3: Hoare triple {641#true} call #t~ret5 := main(); {641#true} is VALID [2020-07-10 14:44:14,229 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-10 14:44:14,229 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-10 14:44:14,230 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {641#true} is VALID [2020-07-10 14:44:14,230 INFO L263 TraceCheckUtils]: 7: Hoare triple {641#true} call #t~ret4 := gcd(~m~0, ~n~0); {641#true} is VALID [2020-07-10 14:44:14,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-10 14:44:14,230 INFO L280 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {641#true} is VALID [2020-07-10 14:44:14,231 INFO L280 TraceCheckUtils]: 10: Hoare triple {641#true} assume !(~y1 == ~y2); {641#true} is VALID [2020-07-10 14:44:14,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {641#true} assume ~y1 > ~y2; {641#true} is VALID [2020-07-10 14:44:14,231 INFO L263 TraceCheckUtils]: 12: Hoare triple {641#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {641#true} is VALID [2020-07-10 14:44:14,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-10 14:44:14,233 INFO L280 TraceCheckUtils]: 14: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,234 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,234 INFO L280 TraceCheckUtils]: 16: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,236 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:14,236 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-10 14:44:14,237 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,238 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #51#return; {658#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:14,239 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-10 14:44:14,240 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-10 14:44:14,240 INFO L280 TraceCheckUtils]: 23: Hoare triple {642#false} assume !false; {642#false} is VALID [2020-07-10 14:44:14,241 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-10 14:44:14,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090127065] [2020-07-10 14:44:14,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:14,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:44:14,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625171165] [2020-07-10 14:44:14,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 14:44:14,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:14,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:44:14,274 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-10 14:44:14,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:44:14,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:44:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:44:14,276 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2020-07-10 14:44:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:14,486 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 14:44:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:44:14,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 14:44:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 14:44:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 14:44:14,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-10 14:44:14,536 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-10 14:44:14,537 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:44:14,538 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:44:14,538 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-10 14:44:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:44:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-10 14:44:14,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:14,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-10 14:44:14,552 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-10 14:44:14,552 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-10 14:44:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:14,555 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-10 14:44:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-10 14:44:14,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:14,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:14,556 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-10 14:44:14,556 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-10 14:44:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:14,559 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-10 14:44:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-10 14:44:14,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:14,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:14,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:14,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:44:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-10 14:44:14,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2020-07-10 14:44:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:14,562 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-10 14:44:14,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:44:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 14:44:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 14:44:14,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:14,563 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-10 14:44:14,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 14:44:14,564 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 99153721, now seen corresponding path program 1 times [2020-07-10 14:44:14,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:14,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285697748] [2020-07-10 14:44:14,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} assume true; {800#true} is VALID [2020-07-10 14:44:14,604 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {800#true} {800#true} #47#return; {800#true} is VALID [2020-07-10 14:44:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:14,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-10 14:44:14,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,671 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-10 14:44:14,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-10 14:44:14,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,674 INFO L263 TraceCheckUtils]: 4: Hoare triple {819#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {800#true} is VALID [2020-07-10 14:44:14,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-10 14:44:14,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,677 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-10 14:44:14,678 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-10 14:44:14,681 INFO L280 TraceCheckUtils]: 11: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,682 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {826#(<= 1 |gcd_#res|)} {800#true} #51#return; {817#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:14,683 INFO L263 TraceCheckUtils]: 0: Hoare triple {800#true} call ULTIMATE.init(); {800#true} is VALID [2020-07-10 14:44:14,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume true; {800#true} is VALID [2020-07-10 14:44:14,683 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {800#true} {800#true} #47#return; {800#true} is VALID [2020-07-10 14:44:14,683 INFO L263 TraceCheckUtils]: 3: Hoare triple {800#true} call #t~ret5 := main(); {800#true} is VALID [2020-07-10 14:44:14,684 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-10 14:44:14,684 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-10 14:44:14,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {800#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {800#true} is VALID [2020-07-10 14:44:14,684 INFO L263 TraceCheckUtils]: 7: Hoare triple {800#true} call #t~ret4 := gcd(~m~0, ~n~0); {800#true} is VALID [2020-07-10 14:44:14,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-10 14:44:14,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,690 INFO L263 TraceCheckUtils]: 12: Hoare triple {819#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {800#true} is VALID [2020-07-10 14:44:14,690 INFO L280 TraceCheckUtils]: 13: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-10 14:44:14,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:14,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,694 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-10 14:44:14,697 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-10 14:44:14,698 INFO L280 TraceCheckUtils]: 19: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:14,700 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {826#(<= 1 |gcd_#res|)} {800#true} #51#return; {817#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:14,702 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-10 14:44:14,703 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-10 14:44:14,703 INFO L280 TraceCheckUtils]: 23: Hoare triple {801#false} assume !false; {801#false} is VALID [2020-07-10 14:44:14,704 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-10 14:44:14,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285697748] [2020-07-10 14:44:14,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:14,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:44:14,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364153783] [2020-07-10 14:44:14,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 14:44:14,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:14,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:44:14,731 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-10 14:44:14,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:44:14,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:14,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:44:14,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:44:14,733 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2020-07-10 14:44:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:14,946 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-10 14:44:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:44:14,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 14:44:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 14:44:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 14:44:14,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-10 14:44:14,986 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-10 14:44:14,987 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:44:14,988 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:44:14,988 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-10 14:44:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:44:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 14:44:15,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:15,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 14:44:15,011 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:44:15,011 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:44:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:15,014 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 14:44:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 14:44:15,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:15,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:15,015 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:44:15,015 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:44:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:15,018 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 14:44:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 14:44:15,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:15,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:15,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:15,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:44:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-07-10 14:44:15,022 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2020-07-10 14:44:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:15,022 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-07-10 14:44:15,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:44:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 14:44:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 14:44:15,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:15,023 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-10 14:44:15,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 14:44:15,024 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 10057033, now seen corresponding path program 1 times [2020-07-10 14:44:15,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:15,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622135941] [2020-07-10 14:44:15,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:15,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} assume true; {973#true} is VALID [2020-07-10 14:44:15,072 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {973#true} {973#true} #47#return; {973#true} is VALID [2020-07-10 14:44:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:15,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:15,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,160 INFO L280 TraceCheckUtils]: 3: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,161 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:15,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-10 14:44:15,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-10 14:44:15,162 INFO L280 TraceCheckUtils]: 3: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-10 14:44:15,163 INFO L263 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-10 14:44:15,163 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,164 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:15,164 INFO L280 TraceCheckUtils]: 7: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,165 INFO L280 TraceCheckUtils]: 8: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,166 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:15,166 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-10 14:44:15,167 INFO L280 TraceCheckUtils]: 11: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,168 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-10 14:44:15,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-10 14:44:15,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-10 14:44:15,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {973#true} assume !(~y1 > ~y2); {973#true} is VALID [2020-07-10 14:44:15,171 INFO L263 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {973#true} is VALID [2020-07-10 14:44:15,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,171 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-10 14:44:15,171 INFO L280 TraceCheckUtils]: 7: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-10 14:44:15,171 INFO L280 TraceCheckUtils]: 8: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-10 14:44:15,172 INFO L263 TraceCheckUtils]: 9: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-10 14:44:15,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:15,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,183 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:15,184 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-10 14:44:15,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,185 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-10 14:44:15,186 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-10 14:44:15,187 INFO L280 TraceCheckUtils]: 19: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,191 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #51#return; {998#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:15,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {973#true} call ULTIMATE.init(); {973#true} is VALID [2020-07-10 14:44:15,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume true; {973#true} is VALID [2020-07-10 14:44:15,192 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {973#true} {973#true} #47#return; {973#true} is VALID [2020-07-10 14:44:15,192 INFO L263 TraceCheckUtils]: 3: Hoare triple {973#true} call #t~ret5 := main(); {973#true} is VALID [2020-07-10 14:44:15,193 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-10 14:44:15,193 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-10 14:44:15,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {973#true} is VALID [2020-07-10 14:44:15,193 INFO L263 TraceCheckUtils]: 7: Hoare triple {973#true} call #t~ret4 := gcd(~m~0, ~n~0); {973#true} is VALID [2020-07-10 14:44:15,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-10 14:44:15,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-10 14:44:15,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {973#true} assume !(~y1 > ~y2); {973#true} is VALID [2020-07-10 14:44:15,194 INFO L263 TraceCheckUtils]: 12: Hoare triple {973#true} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {973#true} is VALID [2020-07-10 14:44:15,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,195 INFO L280 TraceCheckUtils]: 14: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-10 14:44:15,195 INFO L280 TraceCheckUtils]: 15: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-10 14:44:15,195 INFO L280 TraceCheckUtils]: 16: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-10 14:44:15,196 INFO L263 TraceCheckUtils]: 17: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-10 14:44:15,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-10 14:44:15,198 INFO L280 TraceCheckUtils]: 19: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-10 14:44:15,200 INFO L280 TraceCheckUtils]: 20: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,202 INFO L280 TraceCheckUtils]: 21: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,204 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-10 14:44:15,206 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-10 14:44:15,207 INFO L280 TraceCheckUtils]: 24: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,209 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-10 14:44:15,210 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-10 14:44:15,210 INFO L280 TraceCheckUtils]: 27: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-10 14:44:15,212 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #51#return; {998#(<= 1 |main_#t~ret4|)} is VALID [2020-07-10 14:44:15,212 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-10 14:44:15,213 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-10 14:44:15,213 INFO L280 TraceCheckUtils]: 31: Hoare triple {974#false} assume !false; {974#false} is VALID [2020-07-10 14:44:15,214 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-10 14:44:15,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622135941] [2020-07-10 14:44:15,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:15,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 14:44:15,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607099767] [2020-07-10 14:44:15,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-10 14:44:15,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:15,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 14:44:15,242 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-10 14:44:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 14:44:15,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 14:44:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:44:15,244 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2020-07-10 14:44:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:15,478 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 14:44:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:44:15,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-10 14:44:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:44:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-10 14:44:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:44:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-10 14:44:15,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-10 14:44:15,511 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-10 14:44:15,511 INFO L225 Difference]: With dead ends: 30 [2020-07-10 14:44:15,512 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:44:15,513 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-10 14:44:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:44:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:44:15,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:15,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:15,514 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:15,514 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:15,515 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:44:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:15,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:15,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:15,515 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:15,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:44:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:15,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:15,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:15,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:15,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:44:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:44:15,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-07-10 14:44:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:15,518 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:44:15,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 14:44:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:15,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 14:44:15,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:44:15,614 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:44:15,614 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:44:15,615 INFO L268 CegarLoopResult]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2020-07-10 14:44:15,615 INFO L268 CegarLoopResult]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2020-07-10 14:44:15,615 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-10 14:44:15,615 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-10 14:44:15,615 INFO L271 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2020-07-10 14:44:15,616 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-10 14:44:15,616 INFO L268 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-07-10 14:44:15,616 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-10 14:44:15,616 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-10 14:44:15,616 INFO L268 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-07-10 14:44:15,616 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:44:15,616 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:44:15,617 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:44:15,617 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:44:15,617 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-10 14:44:15,617 INFO L268 CegarLoopResult]: For program point L30(lines 30 32) no Hoare annotation was computed. [2020-07-10 14:44:15,617 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2020-07-10 14:44:15,617 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 28 43) no Hoare annotation was computed. [2020-07-10 14:44:15,617 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-10 14:44:15,618 INFO L268 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2020-07-10 14:44:15,618 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-10 14:44:15,618 INFO L268 CegarLoopResult]: For program point L38-1(lines 28 43) no Hoare annotation was computed. [2020-07-10 14:44:15,618 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-10 14:44:15,618 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-10 14:44:15,623 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:44:15,623 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:44:15,623 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: gcdFINAL has no Hoare annotation [2020-07-10 14:44:15,624 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 14:44:15,625 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 14:44:15,626 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:44:15,627 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:44:15,627 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:44:15,627 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:44:15,627 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-10 14:44:15,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:44:15 BoogieIcfgContainer [2020-07-10 14:44:15,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:44:15,633 INFO L168 Benchmark]: Toolchain (without parser) took 5592.46 ms. Allocated memory was 139.5 MB in the beginning and 276.8 MB in the end (delta: 137.4 MB). Free memory was 104.0 MB in the beginning and 121.3 MB in the end (delta: -17.4 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:15,634 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:44:15,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.13 ms. Allocated memory is still 139.5 MB. Free memory was 103.6 MB in the beginning and 93.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:15,635 INFO L168 Benchmark]: Boogie Preprocessor took 30.76 ms. Allocated memory is still 139.5 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:15,636 INFO L168 Benchmark]: RCFGBuilder took 573.72 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 162.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:15,637 INFO L168 Benchmark]: TraceAbstraction took 4701.40 ms. Allocated memory was 203.4 MB in the beginning and 276.8 MB in the end (delta: 73.4 MB). Free memory was 161.7 MB in the beginning and 121.3 MB in the end (delta: 40.4 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:15,640 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.13 ms. Allocated memory is still 139.5 MB. Free memory was 103.6 MB in the beginning and 93.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.76 ms. Allocated memory is still 139.5 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 573.72 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 162.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4701.40 ms. Allocated memory was 203.4 MB in the beginning and 276.8 MB in the end (delta: 73.4 MB). Free memory was 161.7 MB in the beginning and 121.3 MB in the end (delta: 40.4 MB). Peak memory consumption was 113.8 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.5s, 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.6s 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...