./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/gcd_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c20edfd7ede05443471560aa2c7be34d4e8c171 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:27:18,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:27:18,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:27:18,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:27:18,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:27:18,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:27:18,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:27:18,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:27:18,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:27:18,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:27:18,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:27:18,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:27:18,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:27:18,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:27:18,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:27:18,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:27:18,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:27:18,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:27:18,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:27:18,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:27:18,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:27:18,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:27:18,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:27:18,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:27:18,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:27:18,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:27:18,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:27:18,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:27:18,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:27:18,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:27:18,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:27:18,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:27:18,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:27:18,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:27:18,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:27:18,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:27:18,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:27:18,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:27:18,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:27:18,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:27:18,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:27:18,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:27:19,009 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:27:19,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:27:19,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:27:19,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:27:19,012 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:27:19,012 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:27:19,012 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:27:19,012 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:27:19,013 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:27:19,013 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:27:19,013 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:27:19,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:27:19,014 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:27:19,016 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:27:19,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:27:19,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:27:19,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:27:19,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:27:19,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:27:19,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:27:19,018 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:27:19,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:27:19,018 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:27:19,021 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:27:19,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:27:19,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:27:19,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:27:19,022 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:27:19,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:27:19,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:27:19,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:27:19,023 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:27:19,025 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:27:19,026 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c20edfd7ede05443471560aa2c7be34d4e8c171 [2020-10-26 04:27:19,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:27:19,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:27:19,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:27:19,535 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:27:19,535 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:27:19,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2020-10-26 04:27:19,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7fd963a/b5bbdad179f54833b2261714aaaf384a/FLAG096aa2f57 [2020-10-26 04:27:20,246 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:27:20,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2020-10-26 04:27:20,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7fd963a/b5bbdad179f54833b2261714aaaf384a/FLAG096aa2f57 [2020-10-26 04:27:20,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7fd963a/b5bbdad179f54833b2261714aaaf384a [2020-10-26 04:27:20,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:27:20,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:27:20,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:27:20,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:27:20,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:27:20,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a66335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20, skipping insertion in model container [2020-10-26 04:27:20,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:27:20,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:27:20,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:27:20,799 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:27:20,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:27:20,838 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:27:20,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20 WrapperNode [2020-10-26 04:27:20,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:27:20,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:27:20,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:27:20,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:27:20,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:27:20,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:27:20,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:27:20,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:27:20,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (1/1) ... [2020-10-26 04:27:20,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:27:20,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:27:20,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:27:20,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:27:20,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:21,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:27:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:27:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:27:21,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:27:21,511 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:27:21,511 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-26 04:27:21,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:27:21 BoogieIcfgContainer [2020-10-26 04:27:21,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:27:21,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:27:21,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:27:21,518 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:27:21,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:27:21,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:27:20" (1/3) ... [2020-10-26 04:27:21,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a585375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:27:21, skipping insertion in model container [2020-10-26 04:27:21,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:27:21,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:27:20" (2/3) ... [2020-10-26 04:27:21,522 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a585375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:27:21, skipping insertion in model container [2020-10-26 04:27:21,522 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:27:21,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:27:21" (3/3) ... [2020-10-26 04:27:21,524 INFO L373 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2020-10-26 04:27:21,587 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:27:21,588 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:27:21,588 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:27:21,588 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:27:21,588 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:27:21,588 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:27:21,588 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:27:21,589 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:27:21,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 04:27:21,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:21,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:21,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:21,640 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:27:21,640 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:21,641 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:27:21,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 04:27:21,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:21,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:21,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:21,644 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:27:21,645 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:21,653 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12#L-1true havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 24#L14true assume !(gcd_test_~a < 0); 18#L14-2true assume !(gcd_test_~b < 0); 25#L15-1true assume !(0 == gcd_test_~a); 11#L22-2true [2020-10-26 04:27:21,654 INFO L796 eck$LassoCheckResult]: Loop: 11#L22-2true assume !!(0 != gcd_test_~b); 15#L22true assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 11#L22-2true [2020-10-26 04:27:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2020-10-26 04:27:21,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:21,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251167143] [2020-10-26 04:27:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:21,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:21,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:21,847 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 1 times [2020-10-26 04:27:21,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:21,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477542485] [2020-10-26 04:27:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:21,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:21,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:21,882 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939727, now seen corresponding path program 1 times [2020-10-26 04:27:21,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:21,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367998081] [2020-10-26 04:27:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:22,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367998081] [2020-10-26 04:27:22,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:27:22,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:27:22,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912204631] [2020-10-26 04:27:22,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:27:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:27:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:27:22,078 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-10-26 04:27:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:27:22,123 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-10-26 04:27:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:27:22,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2020-10-26 04:27:22,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:22,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 10 transitions. [2020-10-26 04:27:22,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:27:22,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-26 04:27:22,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-10-26 04:27:22,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:27:22,135 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-26 04:27:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-10-26 04:27:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-26 04:27:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-26 04:27:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-26 04:27:22,165 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-26 04:27:22,166 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-26 04:27:22,166 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:27:22,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-10-26 04:27:22,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:22,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:22,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:22,167 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:27:22,168 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:22,168 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 58#L-1 havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 59#L14 assume !(gcd_test_~a < 0); 63#L14-2 assume !(gcd_test_~b < 0); 64#L15-1 assume !(0 == gcd_test_~a); 65#L22-2 assume !!(0 != gcd_test_~b); 61#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 62#L22-2 [2020-10-26 04:27:22,168 INFO L796 eck$LassoCheckResult]: Loop: 62#L22-2 assume !!(0 != gcd_test_~b); 66#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 62#L22-2 [2020-10-26 04:27:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939725, now seen corresponding path program 1 times [2020-10-26 04:27:22,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:22,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929195521] [2020-10-26 04:27:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,208 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 2 times [2020-10-26 04:27:22,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:22,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713445033] [2020-10-26 04:27:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1302289042, now seen corresponding path program 1 times [2020-10-26 04:27:22,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:22,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58871697] [2020-10-26 04:27:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:22,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58871697] [2020-10-26 04:27:22,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493780507] [2020-10-26 04:27:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:27:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:22,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:27:22,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:22,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:27:22,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-10-26 04:27:22,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994030524] [2020-10-26 04:27:22,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:27:22,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:27:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:27:22,600 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-26 04:27:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:27:22,650 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-10-26 04:27:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:27:22,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-10-26 04:27:22,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:22,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-10-26 04:27:22,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 04:27:22,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 04:27:22,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-10-26 04:27:22,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:27:22,655 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-26 04:27:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-10-26 04:27:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-26 04:27:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-26 04:27:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-26 04:27:22,661 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-26 04:27:22,662 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-26 04:27:22,662 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:27:22,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-10-26 04:27:22,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:22,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:22,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:22,665 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:27:22,666 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:22,666 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 113#L-1 havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 114#L14 assume !(gcd_test_~a < 0); 118#L14-2 assume !(gcd_test_~b < 0); 119#L15-1 assume !(0 == gcd_test_~a); 120#L22-2 assume !!(0 != gcd_test_~b); 116#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 117#L22-2 assume !!(0 != gcd_test_~b); 121#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 123#L22-2 [2020-10-26 04:27:22,666 INFO L796 eck$LassoCheckResult]: Loop: 123#L22-2 assume !!(0 != gcd_test_~b); 122#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 123#L22-2 [2020-10-26 04:27:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1302289040, now seen corresponding path program 2 times [2020-10-26 04:27:22,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:22,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275634762] [2020-10-26 04:27:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,734 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 3 times [2020-10-26 04:27:22,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:22,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009398960] [2020-10-26 04:27:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:22,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:22,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1664285205, now seen corresponding path program 2 times [2020-10-26 04:27:22,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:22,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517622747] [2020-10-26 04:27:22,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:22,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517622747] [2020-10-26 04:27:22,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636429368] [2020-10-26 04:27:22,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:27:22,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:27:22,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:27:22,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:27:22,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:22,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:27:22,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-10-26 04:27:22,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226005926] [2020-10-26 04:27:23,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:27:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:27:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:27:23,002 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-10-26 04:27:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:27:23,038 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-10-26 04:27:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:27:23,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-10-26 04:27:23,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:23,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-10-26 04:27:23,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:27:23,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:27:23,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-10-26 04:27:23,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:27:23,041 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-26 04:27:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-10-26 04:27:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-26 04:27:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-26 04:27:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-26 04:27:23,043 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-26 04:27:23,044 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-26 04:27:23,044 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:27:23,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-10-26 04:27:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:23,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:23,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:23,046 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-10-26 04:27:23,046 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:23,046 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 180#L-1 havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 181#L14 assume !(gcd_test_~a < 0); 185#L14-2 assume !(gcd_test_~b < 0); 186#L15-1 assume !(0 == gcd_test_~a); 187#L22-2 assume !!(0 != gcd_test_~b); 183#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 184#L22-2 assume !!(0 != gcd_test_~b); 188#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 192#L22-2 assume !!(0 != gcd_test_~b); 191#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 190#L22-2 [2020-10-26 04:27:23,046 INFO L796 eck$LassoCheckResult]: Loop: 190#L22-2 assume !!(0 != gcd_test_~b); 189#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 190#L22-2 [2020-10-26 04:27:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1664285203, now seen corresponding path program 3 times [2020-10-26 04:27:23,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:23,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052003905] [2020-10-26 04:27:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:23,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:23,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:23,077 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 4 times [2020-10-26 04:27:23,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:23,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33470296] [2020-10-26 04:27:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:23,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:23,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:23,086 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1650246872, now seen corresponding path program 3 times [2020-10-26 04:27:23,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:23,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876293746] [2020-10-26 04:27:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:23,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:23,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:23,160 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:23,575 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-10-26 04:27:23,893 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-10-26 04:27:23,904 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:27:23,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:27:23,906 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:27:23,906 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:27:23,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:27:23,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:23,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:27:23,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:27:23,908 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2020-10-26 04:27:23,908 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:27:23,908 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:27:23,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:23,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:23,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:27:24,476 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:27:24,482 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:24,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:24,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:27:24,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:27:24,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:24,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:24,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:24,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:24,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:24,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:24,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:24,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:24,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:24,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:24,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:24,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:24,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:24,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:24,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:24,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:24,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:24,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:25,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:25,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:25,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:25,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:25,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:25,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:25,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:25,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:25,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:25,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:25,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:25,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:25,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:27:25,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:27:25,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:27:25,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:27:25,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:27:25,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:27:25,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:27:25,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:27:25,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:27:25,261 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:27:25,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:27:25,281 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-26 04:27:25,281 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-26 04:27:25,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:27:25,454 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-26 04:27:25,455 INFO L444 ModelExtractionUtils]: 25 out of 36 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:27:25,467 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:27:25,530 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-10-26 04:27:25,530 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:27:25,531 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b) = 1*ULTIMATE.start_gcd_test_~b Supporting invariants [1*ULTIMATE.start_gcd_test_~a - 2 >= 0] [2020-10-26 04:27:25,590 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-26 04:27:25,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:25,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:27:25,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:25,749 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:27:25,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:25,754 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2020-10-26 04:27:25,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-26 04:27:25,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 14 states and 15 transitions. Complement of second has 6 states. [2020-10-26 04:27:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 04:27:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:27:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-26 04:27:25,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-26 04:27:25,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:27:25,862 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:27:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:25,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:27:25,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:26,024 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:27:26,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:26,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2020-10-26 04:27:26,026 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-26 04:27:26,125 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 14 states and 15 transitions. Complement of second has 6 states. [2020-10-26 04:27:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 04:27:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:27:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-26 04:27:26,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-26 04:27:26,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:27:26,128 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:27:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:26,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:27:26,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:26,292 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:27:26,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:26,293 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2020-10-26 04:27:26,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-26 04:27:26,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 21 states and 25 transitions. Complement of second has 12 states. [2020-10-26 04:27:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-26 04:27:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:27:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-10-26 04:27:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-26 04:27:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:27:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 13 letters. Loop has 2 letters. [2020-10-26 04:27:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:27:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-26 04:27:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:27:26,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-10-26 04:27:26,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:27:26,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2020-10-26 04:27:26,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:27:26,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 04:27:26,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2020-10-26 04:27:26,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:27:26,483 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-26 04:27:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2020-10-26 04:27:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-10-26 04:27:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-26 04:27:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-10-26 04:27:26,485 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-26 04:27:26,485 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-26 04:27:26,486 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:27:26,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-10-26 04:27:26,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:26,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:26,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:26,490 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2020-10-26 04:27:26,490 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:26,490 INFO L794 eck$LassoCheckResult]: Stem: 463#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 461#L-1 havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 462#L14 assume !(gcd_test_~a < 0); 468#L14-2 assume !(gcd_test_~b < 0); 469#L15-1 assume !(0 == gcd_test_~a); 470#L22-2 assume !!(0 != gcd_test_~b); 477#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 476#L22-2 assume !!(0 != gcd_test_~b); 475#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 474#L22-2 assume !!(0 != gcd_test_~b); 473#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 472#L22-2 assume !!(0 != gcd_test_~b); 464#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 465#L22-2 [2020-10-26 04:27:26,490 INFO L796 eck$LassoCheckResult]: Loop: 465#L22-2 assume !!(0 != gcd_test_~b); 471#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 465#L22-2 [2020-10-26 04:27:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1650246870, now seen corresponding path program 4 times [2020-10-26 04:27:26,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:26,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120003840] [2020-10-26 04:27:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:26,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120003840] [2020-10-26 04:27:26,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:27:26,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:27:26,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312279835] [2020-10-26 04:27:26,617 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:27:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 5 times [2020-10-26 04:27:26,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:26,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133105325] [2020-10-26 04:27:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:26,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:26,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:26,626 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:26,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:27:26,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:27:26,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:27:26,645 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-10-26 04:27:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:27:26,683 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-10-26 04:27:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:27:26,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-10-26 04:27:26,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:26,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2020-10-26 04:27:26,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:27:26,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:27:26,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-10-26 04:27:26,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:27:26,686 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-26 04:27:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-10-26 04:27:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-26 04:27:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-26 04:27:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-26 04:27:26,689 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-26 04:27:26,689 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-26 04:27:26,689 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:27:26,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-10-26 04:27:26,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:26,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:26,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:26,691 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2020-10-26 04:27:26,691 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:26,692 INFO L794 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 506#L-1 havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 507#L14 assume !(gcd_test_~a < 0); 513#L14-2 assume !(gcd_test_~b < 0); 514#L15-1 assume !(0 == gcd_test_~a); 515#L22-2 assume !!(0 != gcd_test_~b); 522#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 521#L22-2 assume !!(0 != gcd_test_~b); 520#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 519#L22-2 assume !!(0 != gcd_test_~b); 518#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 517#L22-2 assume !!(0 != gcd_test_~b); 511#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 512#L22-2 assume !!(0 != gcd_test_~b); 509#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 510#L22-2 [2020-10-26 04:27:26,692 INFO L796 eck$LassoCheckResult]: Loop: 510#L22-2 assume !!(0 != gcd_test_~b); 516#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 510#L22-2 [2020-10-26 04:27:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1044312667, now seen corresponding path program 4 times [2020-10-26 04:27:26,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:26,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688336590] [2020-10-26 04:27:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:26,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688336590] [2020-10-26 04:27:26,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137751416] [2020-10-26 04:27:26,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:27:26,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 04:27:26,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:27:26,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:27:26,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:26,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:27:26,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-10-26 04:27:26,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717546861] [2020-10-26 04:27:26,980 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:27:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:26,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 6 times [2020-10-26 04:27:26,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:26,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586622856] [2020-10-26 04:27:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:26,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:26,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:26,989 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:27,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:27:27,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 04:27:27,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-26 04:27:27,008 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-10-26 04:27:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:27:27,087 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-10-26 04:27:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:27:27,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-10-26 04:27:27,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:27,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2020-10-26 04:27:27,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:27:27,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:27:27,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-26 04:27:27,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:27:27,091 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-26 04:27:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-26 04:27:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-26 04:27:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-26 04:27:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-10-26 04:27:27,094 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-26 04:27:27,094 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-26 04:27:27,094 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:27:27,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-10-26 04:27:27,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:27:27,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:27:27,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:27:27,096 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1, 1] [2020-10-26 04:27:27,096 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:27:27,096 INFO L794 eck$LassoCheckResult]: Stem: 605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 603#L-1 havoc main_#res;havoc main_#t~ret7, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 604#L14 assume !(gcd_test_~a < 0); 610#L14-2 assume !(gcd_test_~b < 0); 611#L15-1 assume !(0 == gcd_test_~a); 612#L22-2 assume !!(0 != gcd_test_~b); 621#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 620#L22-2 assume !!(0 != gcd_test_~b); 619#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 618#L22-2 assume !!(0 != gcd_test_~b); 617#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 615#L22-2 assume !!(0 != gcd_test_~b); 616#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 614#L22-2 assume !!(0 != gcd_test_~b); 608#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 609#L22-2 assume !!(0 != gcd_test_~b); 606#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 607#L22-2 [2020-10-26 04:27:27,096 INFO L796 eck$LassoCheckResult]: Loop: 607#L22-2 assume !!(0 != gcd_test_~b); 613#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 607#L22-2 [2020-10-26 04:27:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1437871456, now seen corresponding path program 5 times [2020-10-26 04:27:27,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:27,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861330357] [2020-10-26 04:27:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:27:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:27,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861330357] [2020-10-26 04:27:27,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436589911] [2020-10-26 04:27:27,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:27:27,300 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-26 04:27:27,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:27:27,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-26 04:27:27,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:27:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:27:27,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:27:27,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-26 04:27:27,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188638216] [2020-10-26 04:27:27,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:27:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:27:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 7 times [2020-10-26 04:27:27,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:27:27,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477394568] [2020-10-26 04:27:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:27:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:27,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:27:27,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:27:27,506 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:27:27,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:27:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 04:27:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-26 04:27:27,525 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-10-26 04:27:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:27:27,711 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-10-26 04:27:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:27:27,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 15 transitions. [2020-10-26 04:27:27,713 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:27:27,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-10-26 04:27:27,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:27:27,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:27:27,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:27:27,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:27:27,713 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:27:27,713 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:27:27,713 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:27:27,713 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:27:27,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:27:27,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:27:27,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:27:27,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:27:27 BoogieIcfgContainer [2020-10-26 04:27:27,727 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:27:27,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:27:27,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:27:27,729 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:27:27,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:27:21" (3/4) ... [2020-10-26 04:27:27,733 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:27:27,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:27:27,736 INFO L168 Benchmark]: Toolchain (without parser) took 7160.85 ms. Allocated memory was 37.7 MB in the beginning and 83.9 MB in the end (delta: 46.1 MB). Free memory was 22.7 MB in the beginning and 35.7 MB in the end (delta: -12.9 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:27:27,737 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 37.7 MB. Free memory was 24.8 MB in the beginning and 24.8 MB in the end (delta: 31.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:27:27,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.32 ms. Allocated memory was 37.7 MB in the beginning and 46.1 MB in the end (delta: 8.4 MB). Free memory was 22.2 MB in the beginning and 29.2 MB in the end (delta: -7.1 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:27:27,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.23 ms. Allocated memory is still 46.1 MB. Free memory was 29.2 MB in the beginning and 27.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:27:27,749 INFO L168 Benchmark]: Boogie Preprocessor took 31.54 ms. Allocated memory is still 46.1 MB. Free memory was 27.7 MB in the beginning and 26.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:27:27,754 INFO L168 Benchmark]: RCFGBuilder took 595.18 ms. Allocated memory is still 46.1 MB. Free memory was 26.6 MB in the beginning and 23.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:27:27,755 INFO L168 Benchmark]: BuchiAutomizer took 6213.32 ms. Allocated memory was 46.1 MB in the beginning and 83.9 MB in the end (delta: 37.7 MB). Free memory was 23.1 MB in the beginning and 36.0 MB in the end (delta: -12.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:27:27,757 INFO L168 Benchmark]: Witness Printer took 5.52 ms. Allocated memory is still 83.9 MB. Free memory was 36.0 MB in the beginning and 35.7 MB in the end (delta: 294.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:27:27,764 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 37.7 MB. Free memory was 24.8 MB in the beginning and 24.8 MB in the end (delta: 31.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 259.32 ms. Allocated memory was 37.7 MB in the beginning and 46.1 MB in the end (delta: 8.4 MB). Free memory was 22.2 MB in the beginning and 29.2 MB in the end (delta: -7.1 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.23 ms. Allocated memory is still 46.1 MB. Free memory was 29.2 MB in the beginning and 27.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.54 ms. Allocated memory is still 46.1 MB. Free memory was 27.7 MB in the beginning and 26.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 595.18 ms. Allocated memory is still 46.1 MB. Free memory was 26.6 MB in the beginning and 23.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6213.32 ms. Allocated memory was 46.1 MB in the beginning and 83.9 MB in the end (delta: 37.7 MB). Free memory was 23.1 MB in the beginning and 36.0 MB in the end (delta: -12.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 16.1 GB. * Witness Printer took 5.52 ms. Allocated memory is still 83.9 MB. Free memory was 36.0 MB in the beginning and 35.7 MB in the end (delta: 294.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function b and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 4.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 69 SDslu, 44 SDs, 0 SdLazy, 270 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf95 lsp66 ukn47 mio100 lsp81 div100 bol100 ite100 ukn100 eq205 hnf90 smp100 dnf122 smp100 tf100 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 273ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...