./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loops/insertion_sort-1.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 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:16:27,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:16:27,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:16:27,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:16:27,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:16:27,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:16:27,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:16:27,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:16:27,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:16:27,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:16:27,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:16:27,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:16:27,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:16:27,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:16:27,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:16:27,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:16:27,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:16:27,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:16:27,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:16:27,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:16:27,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:16:27,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:16:27,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:16:27,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:16:27,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:16:27,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:16:27,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:16:27,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:16:27,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:16:27,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:16:27,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:16:27,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:16:27,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:16:27,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:16:27,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:16:27,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:16:27,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:16:27,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:16:27,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:16:27,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:16:27,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:16:27,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:16:27,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:16:27,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:16:27,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:16:27,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:16:27,912 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:16:27,912 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:16:27,912 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:16:27,913 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:16:27,913 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:16:27,913 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:16:27,914 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:16:27,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:16:27,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:16:27,915 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:16:27,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:16:27,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:16:27,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:16:27,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:16:27,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:16:27,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:16:27,918 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:16:27,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:16:27,918 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:16:27,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:16:27,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:16:27,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:16:27,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:16:27,919 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:16:27,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:16:27,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:16:27,920 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:16:27,923 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:16:27,923 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 [2019-11-28 03:16:28,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:16:28,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:16:28,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:16:28,235 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:16:28,235 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:16:28,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-28 03:16:28,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69113fc1/18368c8abfef49458a6e69eb62ec4543/FLAG317123822 [2019-11-28 03:16:28,811 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:16:28,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-28 03:16:28,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69113fc1/18368c8abfef49458a6e69eb62ec4543/FLAG317123822 [2019-11-28 03:16:29,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69113fc1/18368c8abfef49458a6e69eb62ec4543 [2019-11-28 03:16:29,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:16:29,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:16:29,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:29,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:16:29,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:16:29,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bd84bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29, skipping insertion in model container [2019-11-28 03:16:29,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:16:29,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:16:29,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:29,475 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:16:29,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:29,579 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:16:29,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29 WrapperNode [2019-11-28 03:16:29,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:29,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:29,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:16:29,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:16:29,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:29,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:16:29,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:16:29,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:16:29,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (1/1) ... [2019-11-28 03:16:29,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:16:29,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:16:29,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:16:29,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:16:29,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (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 [2019-11-28 03:16:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:16:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:16:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:16:29,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:16:29,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:16:29,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:16:30,009 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:16:30,010 INFO L297 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 03:16:30,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:30 BoogieIcfgContainer [2019-11-28 03:16:30,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:16:30,016 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:16:30,018 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:16:30,029 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:16:30,030 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:30,031 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:29" (1/3) ... [2019-11-28 03:16:30,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1adecf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:30, skipping insertion in model container [2019-11-28 03:16:30,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:30,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:29" (2/3) ... [2019-11-28 03:16:30,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1adecf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:30, skipping insertion in model container [2019-11-28 03:16:30,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:30,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:30" (3/3) ... [2019-11-28 03:16:30,042 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2019-11-28 03:16:30,116 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:16:30,116 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:16:30,116 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:16:30,117 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:16:30,117 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:16:30,117 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:16:30,117 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:16:30,117 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:16:30,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:16:30,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 03:16:30,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:30,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:30,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:30,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:16:30,159 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:16:30,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:16:30,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 03:16:30,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:30,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:30,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:30,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:16:30,169 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 13#L14-3true [2019-11-28 03:16:30,170 INFO L796 eck$LassoCheckResult]: Loop: 13#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2019-11-28 03:16:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:16:30,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:30,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518055489] [2019-11-28 03:16:30,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2019-11-28 03:16:30,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:30,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017475903] [2019-11-28 03:16:30,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:30,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017475903] [2019-11-28 03:16:30,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:30,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:16:30,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666436715] [2019-11-28 03:16:30,373 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:16:30,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:30,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:16:30,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:16:30,391 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-28 03:16:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:30,400 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-28 03:16:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:16:30,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-28 03:16:30,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-28 03:16:30,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-11-28 03:16:30,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:16:30,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:16:30,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 03:16:30,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:30,411 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:16:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 03:16:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 03:16:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:16:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:16:30,445 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:16:30,445 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:16:30,445 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:16:30,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 03:16:30,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-28 03:16:30,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:30,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:30,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:30,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:16:30,449 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 53#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 54#L14-3 [2019-11-28 03:16:30,449 INFO L796 eck$LassoCheckResult]: Loop: 54#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 49#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2019-11-28 03:16:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:16:30,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:30,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017668055] [2019-11-28 03:16:30,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2019-11-28 03:16:30,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:30,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633603855] [2019-11-28 03:16:30,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:30,619 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2019-11-28 03:16:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866526992] [2019-11-28 03:16:30,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:30,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:30,946 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-28 03:16:31,197 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:16:31,198 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:16:31,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:16:31,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:16:31,199 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:16:31,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,200 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:16:31,200 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:16:31,200 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration2_Lasso [2019-11-28 03:16:31,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:16:31,201 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:16:31,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:31,722 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-28 03:16:31,967 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-28 03:16:32,041 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:16:32,047 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,064 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 [2019-11-28 03:16:32,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,084 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 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,107 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 [2019-11-28 03:16:32,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,113 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:32,132 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 [2019-11-28 03:16:32,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-11-28 03:16:32,151 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 [2019-11-28 03:16:32,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,155 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 [2019-11-28 03:16:32,158 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,171 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 [2019-11-28 03:16:32,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,191 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 [2019-11-28 03:16:32,206 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 [2019-11-28 03:16:32,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,229 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) [2019-11-28 03:16:32,240 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 [2019-11-28 03:16:32,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,247 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,267 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 [2019-11-28 03:16:32,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:32,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:32,278 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) [2019-11-28 03:16:32,294 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 [2019-11-28 03:16:32,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,300 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 [2019-11-28 03:16:32,311 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 [2019-11-28 03:16:32,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:32,323 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) [2019-11-28 03:16:32,347 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 [2019-11-28 03:16:32,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:32,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:32,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,357 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:32,366 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 [2019-11-28 03:16:32,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:32,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:32,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:32,383 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 [2019-11-28 03:16:32,399 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 [2019-11-28 03:16:32,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:32,402 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:16:32,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:32,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:32,428 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:16:32,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:32,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:16:32,621 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:16:32,621 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. 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 [2019-11-28 03:16:32,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:16:32,638 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:16:32,639 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:16:32,640 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-28 03:16:32,656 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 03:16:32,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:16:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:32,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:32,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:32,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:16:32,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:32,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:16:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:32,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 03:16:32,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 03:16:33,135 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 42 states and 59 transitions. Complement of second has 10 states. [2019-11-28 03:16:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:16:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-11-28 03:16:33,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-28 03:16:33,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:33,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-28 03:16:33,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:33,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-28 03:16:33,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:33,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 59 transitions. [2019-11-28 03:16:33,147 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 03:16:33,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 35 states and 49 transitions. [2019-11-28 03:16:33,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 03:16:33,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:16:33,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-11-28 03:16:33,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:33,151 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-11-28 03:16:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-11-28 03:16:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 03:16:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 03:16:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-28 03:16:33,156 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 03:16:33,156 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 03:16:33,156 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:16:33,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 47 transitions. [2019-11-28 03:16:33,158 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-28 03:16:33,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:33,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:33,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:16:33,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:16:33,159 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 182#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 192#L17-5 [2019-11-28 03:16:33,160 INFO L796 eck$LassoCheckResult]: Loop: 192#L17-5 main_#t~short4 := main_~i~0 >= 0; 196#L17-1 assume !main_#t~short4; 198#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 187#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 188#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 191#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 192#L17-5 [2019-11-28 03:16:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-11-28 03:16:33,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399780443] [2019-11-28 03:16:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1336163126, now seen corresponding path program 1 times [2019-11-28 03:16:33,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502050820] [2019-11-28 03:16:33,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,242 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2019-11-28 03:16:33,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050116269] [2019-11-28 03:16:33,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:33,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050116269] [2019-11-28 03:16:33,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:33,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:16:33,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406556795] [2019-11-28 03:16:33,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:16:33,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:16:33,457 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-28 03:16:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:33,536 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-11-28 03:16:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:16:33,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-28 03:16:33,539 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-28 03:16:33,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 53 transitions. [2019-11-28 03:16:33,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 03:16:33,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 03:16:33,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 53 transitions. [2019-11-28 03:16:33,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:33,543 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-28 03:16:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 53 transitions. [2019-11-28 03:16:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2019-11-28 03:16:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:16:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-28 03:16:33,548 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 03:16:33,548 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 03:16:33,548 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:16:33,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-28 03:16:33,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:16:33,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:33,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:33,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:16:33,552 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:16:33,552 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 266#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 267#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 268#L14-4 main_~k~0 := 1; 269#L24-3 [2019-11-28 03:16:33,552 INFO L796 eck$LassoCheckResult]: Loop: 269#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 270#L4 assume !(0 == __VERIFIER_assert_~cond); 279#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 277#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 269#L24-3 [2019-11-28 03:16:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2019-11-28 03:16:33,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028230801] [2019-11-28 03:16:33,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2019-11-28 03:16:33,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890635750] [2019-11-28 03:16:33,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2019-11-28 03:16:33,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486396933] [2019-11-28 03:16:33,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:33,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486396933] [2019-11-28 03:16:33,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:33,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:16:33,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327147828] [2019-11-28 03:16:33,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:16:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:16:33,984 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 03:16:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:34,075 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-11-28 03:16:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:16:34,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2019-11-28 03:16:34,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-28 03:16:34,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 54 transitions. [2019-11-28 03:16:34,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:16:34,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:16:34,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2019-11-28 03:16:34,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:34,079 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-11-28 03:16:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2019-11-28 03:16:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2019-11-28 03:16:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:16:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-28 03:16:34,083 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-28 03:16:34,083 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-28 03:16:34,083 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:16:34,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-28 03:16:34,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:16:34,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:34,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:34,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:34,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:34,085 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 345#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 346#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 353#L17-5 main_#t~short4 := main_~i~0 >= 0; 339#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 340#L17-3 [2019-11-28 03:16:34,086 INFO L796 eck$LassoCheckResult]: Loop: 340#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 343#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 335#L18-2 main_~i~0 := main_~i~0 - 1; 336#L17-5 main_#t~short4 := main_~i~0 >= 0; 359#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 340#L17-3 [2019-11-28 03:16:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash 28698826, now seen corresponding path program 1 times [2019-11-28 03:16:34,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:34,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755917973] [2019-11-28 03:16:34,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,110 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 1 times [2019-11-28 03:16:34,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:34,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698596470] [2019-11-28 03:16:34,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 99226903, now seen corresponding path program 1 times [2019-11-28 03:16:34,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:34,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636775427] [2019-11-28 03:16:34,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:34,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636775427] [2019-11-28 03:16:34,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720734847] [2019-11-28 03:16:34,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:34,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:16:34,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:34,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:16:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:34,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:34,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 03:16:34,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871353724] [2019-11-28 03:16:34,332 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-28 03:16:34,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:16:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:16:34,429 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-11-28 03:16:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:34,541 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-11-28 03:16:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:16:34,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 70 transitions. [2019-11-28 03:16:34,548 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2019-11-28 03:16:34,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 50 states and 61 transitions. [2019-11-28 03:16:34,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 03:16:34,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-28 03:16:34,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2019-11-28 03:16:34,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:34,552 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-11-28 03:16:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2019-11-28 03:16:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-11-28 03:16:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 03:16:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-28 03:16:34,559 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 03:16:34,560 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 03:16:34,560 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:16:34,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-28 03:16:34,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:16:34,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:34,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:34,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:34,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:34,563 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 473#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 474#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 479#L17-5 main_#t~short4 := main_~i~0 >= 0; 490#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 488#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 482#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 483#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 480#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 468#L17-5 [2019-11-28 03:16:34,563 INFO L796 eck$LassoCheckResult]: Loop: 468#L17-5 main_#t~short4 := main_~i~0 >= 0; 463#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 464#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 471#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 467#L18-2 main_~i~0 := main_~i~0 - 1; 468#L17-5 [2019-11-28 03:16:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:34,563 INFO L82 PathProgramCache]: Analyzing trace with hash -273945510, now seen corresponding path program 2 times [2019-11-28 03:16:34,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:34,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235563501] [2019-11-28 03:16:34,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:34,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2019-11-28 03:16:34,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:34,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793699201] [2019-11-28 03:16:34,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1968681057, now seen corresponding path program 1 times [2019-11-28 03:16:34,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:34,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985049367] [2019-11-28 03:16:34,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:34,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:35,033 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2019-11-28 03:16:35,171 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-28 03:16:35,174 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:16:35,174 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:16:35,174 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:16:35,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:16:35,175 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:16:35,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:35,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:16:35,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:16:35,175 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration6_Lasso [2019-11-28 03:16:35,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:16:35,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:16:35,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:35,655 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:16:35,658 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 03:16:35,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 [2019-11-28 03:16:35,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:35,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:35,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:35,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:35,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:35,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:35,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:35,675 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) [2019-11-28 03:16:35,695 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 [2019-11-28 03:16:35,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:35,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:35,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:35,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:35,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:35,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:35,705 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) [2019-11-28 03:16:35,723 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 [2019-11-28 03:16:35,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:35,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:35,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:35,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:35,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:35,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:35,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:16:35,780 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 03:16:35,781 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:35,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:16:35,792 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:16:35,792 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:16:35,793 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2) = 2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2 Supporting invariants [] [2019-11-28 03:16:35,820 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 03:16:35,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:16:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:35,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:35,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:35,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:16:35,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:35,928 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 03:16:35,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:16:36,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 70 states and 83 transitions. Complement of second has 9 states. [2019-11-28 03:16:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:16:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 03:16:36,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 03:16:36,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:36,013 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:16:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:36,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:36,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:36,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:16:36,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:36,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 03:16:36,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:16:36,177 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 70 states and 83 transitions. Complement of second has 9 states. [2019-11-28 03:16:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:16:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 03:16:36,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 03:16:36,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:36,180 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:16:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:36,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:36,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:36,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:16:36,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:36,298 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 03:16:36,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:16:36,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 71 states and 88 transitions. Complement of second has 8 states. [2019-11-28 03:16:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:16:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2019-11-28 03:16:36,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 03:16:36,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:36,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 14 letters. Loop has 5 letters. [2019-11-28 03:16:36,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:36,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 9 letters. Loop has 10 letters. [2019-11-28 03:16:36,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:36,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 88 transitions. [2019-11-28 03:16:36,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:16:36,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 39 states and 46 transitions. [2019-11-28 03:16:36,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:16:36,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:16:36,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-11-28 03:16:36,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:36,414 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 03:16:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-11-28 03:16:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-11-28 03:16:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 03:16:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 03:16:36,418 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 03:16:36,418 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 03:16:36,418 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:16:36,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-28 03:16:36,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:16:36,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:36,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:36,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:36,422 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:16:36,422 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 915#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 916#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 923#L17-5 main_#t~short4 := main_~i~0 >= 0; 933#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 911#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 921#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 922#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 924#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 917#L14-4 main_~k~0 := 1; 918#L24-3 [2019-11-28 03:16:36,422 INFO L796 eck$LassoCheckResult]: Loop: 918#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 919#L4 assume !(0 == __VERIFIER_assert_~cond); 927#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 926#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 918#L24-3 [2019-11-28 03:16:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2019-11-28 03:16:36,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:36,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991130030] [2019-11-28 03:16:36,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:36,446 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2019-11-28 03:16:36,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:36,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914573729] [2019-11-28 03:16:36,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:36,459 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2019-11-28 03:16:36,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:36,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138918510] [2019-11-28 03:16:36,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:36,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:36,843 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2019-11-28 03:16:36,986 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-28 03:16:36,991 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:16:36,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:16:36,991 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:16:36,991 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:16:36,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:16:36,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:36,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:16:36,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:16:36,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration7_Lasso [2019-11-28 03:16:36,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:16:36,993 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:16:36,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:37,614 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:16:37,614 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,619 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 [2019-11-28 03:16:37,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,623 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,631 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 [2019-11-28 03:16:37,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,634 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,642 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 [2019-11-28 03:16:37,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,646 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,653 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 [2019-11-28 03:16:37,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:37,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:37,664 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:37,679 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 [2019-11-28 03:16:37,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,692 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:37,702 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 [2019-11-28 03:16:37,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,708 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:37,716 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 [2019-11-28 03:16:37,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,721 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,728 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 [2019-11-28 03:16:37,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,738 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,749 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 [2019-11-28 03:16:37,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,754 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,760 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 [2019-11-28 03:16:37,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,766 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,771 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 [2019-11-28 03:16:37,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,775 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,781 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 [2019-11-28 03:16:37,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:37,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:37,787 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,793 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 [2019-11-28 03:16:37,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:37,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:37,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:37,797 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,804 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 [2019-11-28 03:16:37,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:37,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:37,812 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:37,819 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:37,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:37,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:37,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:37,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:37,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:37,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:16:37,891 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:16:37,891 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:37,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:16:37,900 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:16:37,900 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:16:37,900 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2019-11-28 03:16:37,915 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 03:16:37,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:16:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:37,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:37,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:37,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:16:37,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:37,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:16:37,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 03:16:37,979 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 4 states. [2019-11-28 03:16:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:16:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-28 03:16:37,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 03:16:37,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:37,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 03:16:37,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:37,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-28 03:16:37,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:37,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-28 03:16:37,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:16:37,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-11-28 03:16:37,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:16:37,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:16:37,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:16:37,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:37,984 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:37,984 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:37,984 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:37,984 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:16:37,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:16:37,984 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:16:37,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:16:37,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:37 BoogieIcfgContainer [2019-11-28 03:16:37,991 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:16:37,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:16:37,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:16:37,992 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:16:37,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:30" (3/4) ... [2019-11-28 03:16:37,996 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:16:37,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:16:37,999 INFO L168 Benchmark]: Toolchain (without parser) took 8772.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 960.4 MB in the beginning and 988.9 MB in the end (delta: -28.6 MB). Peak memory consumption was 277.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:37,999 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:38,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:38,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:38,001 INFO L168 Benchmark]: Boogie Preprocessor took 29.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:38,002 INFO L168 Benchmark]: RCFGBuilder took 357.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:38,003 INFO L168 Benchmark]: BuchiAutomizer took 7974.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 123.5 MB). Peak memory consumption was 287.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:38,003 INFO L168 Benchmark]: Witness Printer took 5.63 ms. Allocated memory is still 1.3 GB. Free memory is still 988.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:38,007 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 357.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7974.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 123.5 MB). Peak memory consumption was 287.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.63 ms. Allocated memory is still 1.3 GB. Free memory is still 988.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -2 * j and consists of 6 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + unknown-#length-unknown[v] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 146 SDtfs, 246 SDslu, 185 SDs, 0 SdLazy, 248 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf99 lsp95 ukn64 mio100 lsp77 div222 bol100 ite100 ukn100 eq148 hnf58 smp86 dnf129 smp87 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 253ms VariablesStem: 6 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...