./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer --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 67df9bfb6d520441572384e685c149d99c29f78c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:52:56,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:52:56,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:52:56,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:52:56,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:52:56,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:52:56,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:52:56,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:52:56,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:52:56,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:52:56,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:52:56,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:52:56,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:52:56,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:52:56,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:52:56,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:52:56,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:52:56,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:52:56,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:52:56,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:52:56,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:52:56,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:52:56,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:52:56,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:52:56,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:52:56,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:52:56,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:52:56,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:52:56,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:52:56,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:52:56,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:52:56,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:52:56,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:52:56,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:52:56,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:52:56,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:52:56,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:52:56,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:52:56,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:52:56,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:52:56,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:52:56,753 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:52:56,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:52:56,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:52:56,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:52:56,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:52:56,770 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:52:56,770 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:52:56,770 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:52:56,770 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:52:56,771 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:52:56,771 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:52:56,771 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:52:56,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:52:56,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:52:56,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:52:56,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:52:56,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:52:56,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:52:56,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:52:56,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:52:56,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:52:56,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:52:56,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:52:56,774 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:52:56,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:52:56,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:52:56,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:52:56,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:52:56,775 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:52:56,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:52:56,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:52:56,776 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:52:56,777 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:52:56,777 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer 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 -> 67df9bfb6d520441572384e685c149d99c29f78c [2019-11-15 21:52:56,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:52:56,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:52:56,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:52:56,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:52:56,815 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:52:56,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/../../sv-benchmarks/c/loops/insertion_sort-2.c [2019-11-15 21:52:56,863 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/data/57e496938/7b70197968a2467caf02bb6d568d7adf/FLAG1df409e1f [2019-11-15 21:52:57,280 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:52:57,281 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/sv-benchmarks/c/loops/insertion_sort-2.c [2019-11-15 21:52:57,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/data/57e496938/7b70197968a2467caf02bb6d568d7adf/FLAG1df409e1f [2019-11-15 21:52:57,300 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/data/57e496938/7b70197968a2467caf02bb6d568d7adf [2019-11-15 21:52:57,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:52:57,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:52:57,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:57,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:52:57,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:52:57,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df1a1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57, skipping insertion in model container [2019-11-15 21:52:57,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:52:57,330 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:52:57,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:57,548 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:52:57,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:57,593 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:52:57,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57 WrapperNode [2019-11-15 21:52:57,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:57,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:52:57,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:52:57,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:52:57,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:52:57,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:52:57,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:52:57,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:52:57,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... [2019-11-15 21:52:57,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:52:57,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:52:57,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:52:57,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:52:57,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fca48435-a596-4569-bf4d-fc14c0800e2b/bin/uautomizer/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-15 21:52:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:52:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:52:57,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:52:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:52:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:52:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:52:57,998 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:52:57,999 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:52:58,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:58 BoogieIcfgContainer [2019-11-15 21:52:58,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:52:58,000 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:52:58,001 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:52:58,004 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:52:58,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:52:58,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:52:57" (1/3) ... [2019-11-15 21:52:58,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44860909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:52:58, skipping insertion in model container [2019-11-15 21:52:58,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:52:58,007 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:57" (2/3) ... [2019-11-15 21:52:58,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44860909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:52:58, skipping insertion in model container [2019-11-15 21:52:58,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:52:58,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:58" (3/3) ... [2019-11-15 21:52:58,009 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertion_sort-2.c [2019-11-15 21:52:58,055 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:52:58,055 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:52:58,055 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:52:58,056 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:52:58,056 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:52:58,057 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:52:58,057 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:52:58,057 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:52:58,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:52:58,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 21:52:58,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:52:58,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:52:58,104 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:52:58,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:52:58,105 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:52:58,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:52:58,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 21:52:58,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:52:58,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:52:58,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:52:58,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:52:58,115 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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; 11#L14-3true [2019-11-15 21:52:58,116 INFO L793 eck$LassoCheckResult]: Loop: 11#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; 13#L17-5true assume !true; 12#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 14#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-3true [2019-11-15 21:52:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 21:52:58,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:58,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315742278] [2019-11-15 21:52:58,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,292 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:52:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2019-11-15 21:52:58,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:58,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427343656] [2019-11-15 21:52:58,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:58,338 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-15 21:52:58,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427343656] [2019-11-15 21:52:58,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:58,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:52:58,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465193712] [2019-11-15 21:52:58,345 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:52:58,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:58,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:52:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:52:58,361 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 21:52:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:58,366 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-15 21:52:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:52:58,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-15 21:52:58,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 21:52:58,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2019-11-15 21:52:58,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:52:58,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:52:58,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-15 21:52:58,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:52:58,373 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 21:52:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-15 21:52:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 21:52:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:52:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-15 21:52:58,397 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 21:52:58,397 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 21:52:58,397 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:52:58,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-15 21:52:58,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 21:52:58,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:52:58,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:52:58,399 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:52:58,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:52:58,399 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 48#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; 49#L14-3 [2019-11-15 21:52:58,400 INFO L793 eck$LassoCheckResult]: Loop: 49#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; 55#L17-5 main_#t~short4 := main_~i~0 >= 0; 44#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; 45#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 53#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 54#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 49#L14-3 [2019-11-15 21:52:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 21:52:58,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:58,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226042214] [2019-11-15 21:52:58,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,436 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:52:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:58,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2019-11-15 21:52:58,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:58,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50544845] [2019-11-15 21:52:58,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:52:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2019-11-15 21:52:58,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:58,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009572631] [2019-11-15 21:52:58,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:58,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:58,559 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:52:58,768 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-15 21:52:58,939 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 21:52:59,104 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:52:59,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:52:59,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:52:59,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:52:59,112 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:52:59,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:52:59,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:52:59,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:52:59,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration2_Lasso [2019-11-15 21:52:59,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:52:59,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:52:59,142 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-15 21:52:59,149 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-15 21:52:59,152 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-15 21:52:59,154 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-15 21:52:59,156 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-15 21:52:59,165 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-15 21:52:59,170 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-15 21:52:59,174 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-15 21:52:59,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-15 21:52:59,185 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-15 21:52:59,189 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-15 21:52:59,192 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-15 21:52:59,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-15 21:52:59,406 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-15 21:52:59,854 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-15 21:52:59,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:52:59,942 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:52:59,945 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-15 21:52:59,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,950 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,953 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-15 21:52:59,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,958 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,958 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,961 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-15 21:52:59,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,967 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-15 21:52:59,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,975 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-15 21:52:59,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,983 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-15 21:52:59,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,985 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,989 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-15 21:52:59,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:52:59,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:52:59,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:52:59,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:52:59,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:52:59,996 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-15 21:52:59,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:52:59,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:52:59,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:52:59,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,003 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:00,003 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:00,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,008 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-15 21:53:00,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:00,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:00,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:00,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:00,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,012 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-15 21:53:00,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:00,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:00,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:00,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:00,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,015 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-15 21:53:00,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:00,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:00,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:00,017 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:00,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,018 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-15 21:53:00,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:00,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:00,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:00,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:00,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,023 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-15 21:53:00,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:00,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:00,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,025 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:00,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:00,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,026 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-15 21:53:00,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:00,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,029 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:00,029 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:00,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:00,037 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-15 21:53:00,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:00,045 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:53:00,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:00,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:00,054 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:53:00,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:00,156 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:53:00,183 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:53:00,183 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:53:00,185 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:53:00,186 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:53:00,187 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:53:00,187 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 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-15 21:53:00,196 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 21:53:00,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:53:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:00,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:00,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:00,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:53:00,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:00,285 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-15 21:53:00,287 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-15 21:53:00,288 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:53:00,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2019-11-15 21:53:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:53:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:53:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 21:53:00,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 21:53:00,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:00,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 21:53:00,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:00,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-15 21:53:00,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:00,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-11-15 21:53:00,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:53:00,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2019-11-15 21:53:00,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:53:00,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:53:00,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 21:53:00,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:00,356 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:53:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 21:53:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 21:53:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:53:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 21:53:00,359 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 21:53:00,359 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 21:53:00,359 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:53:00,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 21:53:00,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:53:00,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:00,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:00,360 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:53:00,360 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:00,361 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#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; 144#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; 151#L17-5 [2019-11-15 21:53:00,361 INFO L793 eck$LassoCheckResult]: Loop: 151#L17-5 main_#t~short4 := main_~i~0 >= 0; 137#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; 138#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;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;main_~i~0 := main_~i~0 - 1; 151#L17-5 [2019-11-15 21:53:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-11-15 21:53:00,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:00,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306694899] [2019-11-15 21:53:00,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:00,396 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2019-11-15 21:53:00,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:00,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506844224] [2019-11-15 21:53:00,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:00,414 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2019-11-15 21:53:00,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:00,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519634355] [2019-11-15 21:53:00,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:00,470 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:00,582 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-15 21:53:00,730 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 21:53:00,881 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-15 21:53:00,883 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:53:00,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:53:00,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:53:00,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:53:00,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:53:00,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:53:00,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:53:00,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:53:00,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration3_Lasso [2019-11-15 21:53:00,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:53:00,884 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:53:00,887 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-15 21:53:00,891 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-15 21:53:00,897 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-15 21:53:00,902 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-15 21:53:00,908 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-15 21:53:00,912 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-15 21:53:00,914 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-15 21:53:00,917 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-15 21:53:00,919 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-15 21:53:00,922 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-15 21:53:00,924 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-15 21:53:01,053 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-15 21:53:01,055 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-15 21:53:01,059 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-15 21:53:01,273 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:53:01,274 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:53:01,274 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-15 21:53:01,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,277 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-15 21:53:01,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,279 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-15 21:53:01,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,281 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-15 21:53:01,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,281 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,282 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,283 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-15 21:53:01,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:01,285 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:01,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,298 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-15 21:53:01,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,300 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,301 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-15 21:53:01,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,302 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,302 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,303 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-15 21:53:01,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,303 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,305 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-15 21:53:01,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,307 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-15 21:53:01,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:01,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,312 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:01,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:01,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,317 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-15 21:53:01,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,320 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:01,320 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:01,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:01,330 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-15 21:53:01,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:01,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:01,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:01,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:01,340 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:01,340 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:01,376 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:53:01,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:53:01,389 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:53:01,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:53:01,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:53:01,392 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:53:01,393 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-11-15 21:53:01,401 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 21:53:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:01,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:01,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:01,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:53:01,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:01,471 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-15 21:53:01,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:53:01,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-15 21:53:01,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 69 states and 87 transitions. Complement of second has 9 states. [2019-11-15 21:53:01,515 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-15 21:53:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:53:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-11-15 21:53:01,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-15 21:53:01,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:01,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 21:53:01,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:01,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-15 21:53:01,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:01,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2019-11-15 21:53:01,519 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2019-11-15 21:53:01,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 58 transitions. [2019-11-15 21:53:01,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-15 21:53:01,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-15 21:53:01,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2019-11-15 21:53:01,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:01,521 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-11-15 21:53:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2019-11-15 21:53:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2019-11-15 21:53:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 21:53:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-11-15 21:53:01,525 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-15 21:53:01,525 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-15 21:53:01,525 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:53:01,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-11-15 21:53:01,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:53:01,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:01,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:01,526 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:53:01,527 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:53:01,527 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#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; 284#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 285#L14-4 main_~k~0 := 1; 281#L23-3 [2019-11-15 21:53:01,527 INFO L793 eck$LassoCheckResult]: Loop: 281#L23-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; 282#L4 assume !(0 == __VERIFIER_assert_~cond); 295#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 286#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 281#L23-3 [2019-11-15 21:53:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2019-11-15 21:53:01,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:01,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619638162] [2019-11-15 21:53:01,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:01,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:01,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:01,538 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:01,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:01,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2019-11-15 21:53:01,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:01,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144879138] [2019-11-15 21:53:01,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:01,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:01,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:01,550 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:01,550 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2019-11-15 21:53:01,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:01,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356199669] [2019-11-15 21:53:01,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:01,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:01,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:01,744 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-15 21:53:01,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356199669] [2019-11-15 21:53:01,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:01,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:01,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048358589] [2019-11-15 21:53:01,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:01,931 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-15 21:53:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:02,036 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-11-15 21:53:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:02,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-15 21:53:02,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:53:02,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2019-11-15 21:53:02,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:53:02,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:53:02,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-11-15 21:53:02,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:02,039 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-15 21:53:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-11-15 21:53:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-15 21:53:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 21:53:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-15 21:53:02,041 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 21:53:02,041 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 21:53:02,041 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:53:02,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-15 21:53:02,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:53:02,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:02,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:02,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:02,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:02,043 INFO L791 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 342#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; 343#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; 349#L17-5 main_#t~short4 := main_~i~0 >= 0; 338#L17-1 assume !main_#t~short4; 339#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 347#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 348#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 350#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; 352#L17-5 [2019-11-15 21:53:02,043 INFO L793 eck$LassoCheckResult]: Loop: 352#L17-5 main_#t~short4 := main_~i~0 >= 0; 336#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; 337#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;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;main_~i~0 := main_~i~0 - 1; 352#L17-5 [2019-11-15 21:53:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2019-11-15 21:53:02,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:02,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277809446] [2019-11-15 21:53:02,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:02,068 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-15 21:53:02,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277809446] [2019-11-15 21:53:02,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:02,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:53:02,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613977602] [2019-11-15 21:53:02,069 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:53:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2019-11-15 21:53:02,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:02,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772901452] [2019-11-15 21:53:02,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,077 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:02,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:53:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:02,185 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-15 21:53:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:02,239 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2019-11-15 21:53:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:53:02,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 21:53:02,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 21:53:02,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2019-11-15 21:53:02,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 21:53:02,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 21:53:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2019-11-15 21:53:02,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:02,248 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-11-15 21:53:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2019-11-15 21:53:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-11-15 21:53:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 21:53:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-11-15 21:53:02,251 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 21:53:02,251 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 21:53:02,251 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:53:02,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-11-15 21:53:02,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:53:02,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:02,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:02,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:02,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:53:02,252 INFO L791 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#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; 418#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; 424#L17-5 main_#t~short4 := main_~i~0 >= 0; 413#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; 414#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 422#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 419#L14-4 main_~k~0 := 1; 415#L23-3 [2019-11-15 21:53:02,252 INFO L793 eck$LassoCheckResult]: Loop: 415#L23-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; 416#L4 assume !(0 == __VERIFIER_assert_~cond); 429#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 420#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L23-3 [2019-11-15 21:53:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2019-11-15 21:53:02,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:02,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528464774] [2019-11-15 21:53:02,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,291 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2019-11-15 21:53:02,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:02,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279858878] [2019-11-15 21:53:02,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,302 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2019-11-15 21:53:02,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:02,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841431913] [2019-11-15 21:53:02,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:02,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:02,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:02,729 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-11-15 21:53:02,909 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-15 21:53:02,910 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:53:02,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:53:02,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:53:02,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:53:02,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:53:02,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:53:02,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:53:02,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:53:02,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration6_Lasso [2019-11-15 21:53:02,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:53:02,911 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:53:02,914 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-15 21:53:02,923 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-15 21:53:02,929 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-15 21:53:02,932 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-15 21:53:02,935 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-15 21:53:02,938 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-15 21:53:02,940 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-15 21:53:02,942 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-15 21:53:02,947 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-15 21:53:02,949 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-15 21:53:03,144 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-15 21:53:03,146 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-15 21:53:03,153 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-15 21:53:03,156 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-15 21:53:03,506 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:53:03,506 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:53:03,506 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-15 21:53:03,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,507 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,508 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,508 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,508 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-15 21:53:03,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,509 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,510 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-15 21:53:03,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,512 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-15 21:53:03,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,518 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:03,518 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:03,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,520 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-15 21:53:03,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,521 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,521 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,521 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,522 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,522 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,523 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-15 21:53:03,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,523 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,524 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,525 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-15 21:53:03,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,527 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-15 21:53:03,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,528 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,529 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,531 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-15 21:53:03,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:03,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:03,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:03,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:03,533 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-15 21:53:03,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:03,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:03,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:03,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:03,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:03,537 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:03,586 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:53:03,652 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:53:03,652 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:53:03,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:53:03,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:53:03,653 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:53:03,653 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~#v~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2019-11-15 21:53:03,685 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 21:53:03,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:53:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:03,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:03,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:03,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:53:03,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:03,760 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-15 21:53:03,760 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-15 21:53:03,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 21:53:03,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 33 states and 43 transitions. Complement of second has 4 states. [2019-11-15 21:53:03,774 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-15 21:53:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:53:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 21:53:03,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 21:53:03,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:03,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 21:53:03,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:03,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-15 21:53:03,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:03,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-15 21:53:03,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:53:03,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2019-11-15 21:53:03,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:53:03,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:53:03,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-11-15 21:53:03,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:53:03,778 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-15 21:53:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-11-15 21:53:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-15 21:53:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:53:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-11-15 21:53:03,780 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-15 21:53:03,780 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-15 21:53:03,780 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:53:03,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-11-15 21:53:03,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:53:03,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:53:03,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:53:03,781 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 21:53:03,781 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:53:03,781 INFO L791 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#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; 556#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; 562#L17-5 main_#t~short4 := main_~i~0 >= 0; 576#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; 572#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 566#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 567#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 563#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; 564#L17-5 main_#t~short4 := main_~i~0 >= 0; 558#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; 559#L17-3 [2019-11-15 21:53:03,781 INFO L793 eck$LassoCheckResult]: Loop: 559#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;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;main_~i~0 := main_~i~0 - 1; 568#L17-5 main_#t~short4 := main_~i~0 >= 0; 571#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; 559#L17-3 [2019-11-15 21:53:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2019-11-15 21:53:03,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:03,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9709672] [2019-11-15 21:53:03,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:03,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:03,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2019-11-15 21:53:03,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:03,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332056644] [2019-11-15 21:53:03,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:03,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:03,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2019-11-15 21:53:03,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:03,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135244871] [2019-11-15 21:53:03,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:03,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:03,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:53:03,873 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:53:03,990 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-11-15 21:53:04,403 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2019-11-15 21:53:04,685 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-11-15 21:53:04,687 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:53:04,687 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:53:04,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:53:04,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:53:04,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:53:04,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:53:04,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:53:04,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:53:04,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration7_Lasso [2019-11-15 21:53:04,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:53:04,688 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:53:04,692 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-15 21:53:04,695 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-15 21:53:04,696 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-15 21:53:04,973 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 21:53:05,099 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-15 21:53:05,100 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-15 21:53:05,102 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-15 21:53:05,103 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-15 21:53:05,104 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-15 21:53:05,106 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-15 21:53:05,113 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-15 21:53:05,115 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-15 21:53:05,118 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-15 21:53:05,120 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-15 21:53:05,509 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-11-15 21:53:05,632 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:53:05,632 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:53:05,632 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-15 21:53:05,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:05,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:05,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:05,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:05,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:05,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:05,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:05,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:05,634 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-15 21:53:05,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:05,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:05,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:05,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:05,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:05,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:05,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:05,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:05,636 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-15 21:53:05,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:05,637 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:53:05,637 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:53:05,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:05,642 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 21:53:05,642 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:53:05,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:05,667 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-15 21:53:05,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:05,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:05,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:05,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:05,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:05,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:05,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:05,671 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-15 21:53:05,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:05,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:53:05,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:05,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:05,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:05,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:53:05,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:53:05,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:53:05,673 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-15 21:53:05,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:53:05,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:53:05,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:53:05,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:53:05,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:53:05,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:53:05,688 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:53:05,702 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 21:53:05,702 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 21:53:05,703 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:53:05,703 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:53:05,704 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:53:05,704 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 21:53:05,722 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 21:53:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:05,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:05,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:05,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:53:05,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:05,805 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-15 21:53:05,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:53:05,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 21:53:05,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-11-15 21:53:05,892 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-15 21:53:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:53:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-15 21:53:05,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 21:53:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:05,893 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:53:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:05,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:05,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:05,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:53:05,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:05,952 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-15 21:53:05,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:53:05,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 21:53:06,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 9 states. [2019-11-15 21:53:06,000 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-15 21:53:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:53:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-15 21:53:06,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 21:53:06,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:06,001 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:53:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:06,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:06,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:53:06,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:06,065 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-15 21:53:06,065 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 3 loop predicates [2019-11-15 21:53:06,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 21:53:06,128 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 107 transitions. Complement of second has 10 states. [2019-11-15 21:53:06,130 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-15 21:53:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:53:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-15 21:53:06,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 21:53:06,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:06,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 21:53:06,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:06,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 21:53:06,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:53:06,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2019-11-15 21:53:06,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:53:06,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-11-15 21:53:06,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:53:06,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:53:06,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:53:06,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:53:06,135 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:53:06,135 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:53:06,135 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:53:06,135 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:53:06,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:53:06,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:53:06,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:53:06,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:53:06 BoogieIcfgContainer [2019-11-15 21:53:06,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:53:06,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:53:06,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:53:06,143 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:53:06,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:58" (3/4) ... [2019-11-15 21:53:06,148 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:53:06,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:53:06,150 INFO L168 Benchmark]: Toolchain (without parser) took 8845.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 950.0 MB in the beginning and 987.5 MB in the end (delta: -37.4 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:06,150 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:06,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:06,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:06,156 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:06,156 INFO L168 Benchmark]: RCFGBuilder took 350.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:06,157 INFO L168 Benchmark]: BuchiAutomizer took 8140.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 987.5 MB in the end (delta: 147.4 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:06,157 INFO L168 Benchmark]: Witness Printer took 5.26 ms. Allocated memory is still 1.2 GB. Free memory is still 987.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:06,164 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 350.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8140.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 987.5 MB in the end (delta: 147.4 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.26 ms. Allocated memory is still 1.2 GB. Free memory is still 987.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[v] + -4 * k + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 159 SDslu, 84 SDs, 0 SdLazy, 165 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf99 lsp84 ukn80 mio100 lsp65 div200 bol100 ite100 ukn100 eq150 hnf60 smp88 dnf147 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 7 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...