./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/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 9722a10940ebd7a5d75170225a40cd37454d0528 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 07:50:49,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 07:50:49,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 07:50:49,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 07:50:49,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 07:50:49,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 07:50:49,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 07:50:49,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 07:50:49,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 07:50:49,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 07:50:49,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 07:50:49,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 07:50:49,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 07:50:49,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 07:50:49,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 07:50:49,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 07:50:49,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 07:50:49,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 07:50:49,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 07:50:49,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 07:50:49,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 07:50:49,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 07:50:49,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 07:50:49,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 07:50:49,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 07:50:49,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 07:50:49,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 07:50:49,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 07:50:49,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 07:50:49,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 07:50:49,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 07:50:49,868 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 07:50:49,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 07:50:49,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 07:50:49,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 07:50:49,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 07:50:49,870 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 07:50:49,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 07:50:49,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 07:50:49,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 07:50:49,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 07:50:49,879 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 07:50:49,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 07:50:49,879 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 07:50:49,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 07:50:49,881 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 07:50:49,881 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 07:50:49,881 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 07:50:49,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 07:50:49,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 07:50:49,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 07:50:49,881 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 07:50:49,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 07:50:49,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 07:50:49,882 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 07:50:49,882 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 07:50:49,882 INFO L133 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/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/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 -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-12-08 07:50:49,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 07:50:49,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 07:50:49,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 07:50:49,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 07:50:49,912 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 07:50:49,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-08 07:50:49,959 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/data/5aef84dc1/000287f123e34024a7ef80697d080810/FLAG01d71d610 [2018-12-08 07:50:50,345 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 07:50:50,345 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-08 07:50:50,348 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/data/5aef84dc1/000287f123e34024a7ef80697d080810/FLAG01d71d610 [2018-12-08 07:50:50,356 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/uautomizer/data/5aef84dc1/000287f123e34024a7ef80697d080810 [2018-12-08 07:50:50,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 07:50:50,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 07:50:50,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 07:50:50,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 07:50:50,361 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 07:50:50,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c57853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50, skipping insertion in model container [2018-12-08 07:50:50,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 07:50:50,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 07:50:50,462 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:50:50,464 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 07:50:50,476 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 07:50:50,487 INFO L195 MainTranslator]: Completed translation [2018-12-08 07:50:50,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50 WrapperNode [2018-12-08 07:50:50,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 07:50:50,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 07:50:50,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 07:50:50,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 07:50:50,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 07:50:50,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 07:50:50,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 07:50:50,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 07:50:50,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... [2018-12-08 07:50:50,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 07:50:50,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 07:50:50,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 07:50:50,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 07:50:50,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_474b754b-8999-4c40-908f-a1353e3c3827/bin-2019/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 [2018-12-08 07:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 07:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 07:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 07:50:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 07:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 07:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 07:50:50,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 07:50:50,717 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-08 07:50:50,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:50:50 BoogieIcfgContainer [2018-12-08 07:50:50,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 07:50:50,718 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 07:50:50,718 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 07:50:50,721 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 07:50:50,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 07:50:50,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 07:50:50" (1/3) ... [2018-12-08 07:50:50,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1162e3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 07:50:50, skipping insertion in model container [2018-12-08 07:50:50,722 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 07:50:50,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:50:50" (2/3) ... [2018-12-08 07:50:50,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1162e3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 07:50:50, skipping insertion in model container [2018-12-08 07:50:50,723 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 07:50:50,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:50:50" (3/3) ... [2018-12-08 07:50:50,724 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-12-08 07:50:50,761 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 07:50:50,761 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 07:50:50,761 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 07:50:50,761 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 07:50:50,762 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 07:50:50,762 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 07:50:50,762 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 07:50:50,762 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 07:50:50,762 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 07:50:50,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-12-08 07:50:50,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 07:50:50,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:50,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:50,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 07:50:50,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 07:50:50,791 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 07:50:50,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-12-08 07:50:50,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 07:50:50,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:50,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:50,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 07:50:50,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 07:50:50,799 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 13#L14-3true [2018-12-08 07:50:50,799 INFO L796 eck$LassoCheckResult]: Loop: 13#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2018-12-08 07:50:50,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 07:50:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:50,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2018-12-08 07:50:50,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:50,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:50:50,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 07:50:50,906 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 07:50:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 07:50:50,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 07:50:50,916 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-12-08 07:50:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:50:50,920 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-08 07:50:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 07:50:50,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-08 07:50:50,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-08 07:50:50,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-12-08 07:50:50,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 07:50:50,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 07:50:50,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-08 07:50:50,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 07:50:50,926 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 07:50:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-08 07:50:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-08 07:50:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 07:50:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-08 07:50:50,943 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 07:50:50,943 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 07:50:50,943 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 07:50:50,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-08 07:50:50,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-08 07:50:50,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:50,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:50,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 07:50:50,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 07:50:50,945 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 54#L14-3 [2018-12-08 07:50:50,945 INFO L796 eck$LassoCheckResult]: Loop: 54#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 49#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2018-12-08 07:50:50,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 07:50:50,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:50,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:50,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2018-12-08 07:50:50,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:50,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:50:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:50,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2018-12-08 07:50:50,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:50,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,186 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:50:51,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:50:51,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:50:51,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:50:51,187 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:50:51,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:50:51,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:50:51,187 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:50:51,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-12-08 07:50:51,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:50:51,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:50:51,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,545 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:50:51,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:50:51,549 INFO L122 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 [2018-12-08 07:50:51,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,553 INFO L122 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 [2018-12-08 07:50:51,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,555 INFO L122 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 [2018-12-08 07:50:51,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,557 INFO L122 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 [2018-12-08 07:50:51,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,559 INFO L122 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 [2018-12-08 07:50:51,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,560 INFO L122 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 [2018-12-08 07:50:51,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,562 INFO L122 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 [2018-12-08 07:50:51,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,564 INFO L122 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 [2018-12-08 07:50:51,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:51,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:51,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,568 INFO L122 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 [2018-12-08 07:50:51,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,569 INFO L122 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 [2018-12-08 07:50:51,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,571 INFO L122 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 [2018-12-08 07:50:51,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,573 INFO L122 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 [2018-12-08 07:50:51,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:51,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:51,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:51,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,575 INFO L122 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 [2018-12-08 07:50:51,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:51,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:51,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:51,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:51,581 INFO L122 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 [2018-12-08 07:50:51,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:51,582 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 07:50:51,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:51,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:51,584 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 07:50:51,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:51,613 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:50:51,637 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 07:50:51,637 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 07:50:51,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:50:51,640 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:50:51,640 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:50:51,640 INFO L520 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 [] [2018-12-08 07:50:51,645 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-08 07:50:51,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 07:50:51,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:51,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:51,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:51,717 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 [2018-12-08 07:50:51,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 07:50:51,762 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2018-12-08 07:50:51,762 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 [2018-12-08 07:50:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 07:50:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-08 07:50:51,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 07:50:51,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:51,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 07:50:51,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:51,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-08 07:50:51,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:51,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-12-08 07:50:51,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 07:50:51,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2018-12-08 07:50:51,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 07:50:51,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 07:50:51,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-12-08 07:50:51,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:50:51,770 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 07:50:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-12-08 07:50:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-08 07:50:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 07:50:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-12-08 07:50:51,772 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-08 07:50:51,772 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-08 07:50:51,772 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 07:50:51,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-12-08 07:50:51,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 07:50:51,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:51,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:51,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 07:50:51,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 07:50:51,773 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#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.alloc(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; 158#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; 152#L17-5 [2018-12-08 07:50:51,774 INFO L796 eck$LassoCheckResult]: Loop: 152#L17-5 main_#t~short4 := main_~i~0 >= 0; 147#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; 148#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 155#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 151#L18-2 main_~i~0 := main_~i~0 - 1; 152#L17-5 [2018-12-08 07:50:51,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-12-08 07:50:51,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:51,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:51,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2018-12-08 07:50:51,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:51,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2018-12-08 07:50:51,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:51,987 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:50:51,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:50:51,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:50:51,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:50:51,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:50:51,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:50:51,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:50:51,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:50:51,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-12-08 07:50:51,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:50:51,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:50:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:51,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:52,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:50:52,177 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:50:52,177 INFO L122 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 [2018-12-08 07:50:52,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:52,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:52,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:52,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,180 INFO L122 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 [2018-12-08 07:50:52,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:52,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:52,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:52,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,182 INFO L122 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 [2018-12-08 07:50:52,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:52,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:52,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:52,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,184 INFO L122 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 [2018-12-08 07:50:52,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:52,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:52,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:52,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,186 INFO L122 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 [2018-12-08 07:50:52,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:52,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:52,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,190 INFO L122 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 [2018-12-08 07:50:52,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:52,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:52,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,196 INFO L122 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 [2018-12-08 07:50:52,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:52,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:52,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,203 INFO L122 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 [2018-12-08 07:50:52,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,204 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 07:50:52,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 07:50:52,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:52,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,207 INFO L122 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 [2018-12-08 07:50:52,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:52,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:52,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:52,211 INFO L122 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 [2018-12-08 07:50:52,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:52,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:52,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:52,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:52,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:52,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:52,224 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:50:52,232 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 07:50:52,232 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 07:50:52,233 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:50:52,234 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 07:50:52,234 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:50:52,234 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~j~0 - 1 >= 0] [2018-12-08 07:50:52,240 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 07:50:52,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:52,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:52,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:52,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 07:50:52,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-08 07:50:52,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 57 states and 77 transitions. Complement of second has 10 states. [2018-12-08 07:50:52,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 07:50:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:50:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 07:50:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 5 letters. [2018-12-08 07:50:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 07:50:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-08 07:50:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:52,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2018-12-08 07:50:52,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-08 07:50:52,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 51 transitions. [2018-12-08 07:50:52,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 07:50:52,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 07:50:52,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2018-12-08 07:50:52,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:50:52,371 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-12-08 07:50:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2018-12-08 07:50:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-12-08 07:50:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 07:50:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-12-08 07:50:52,373 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-12-08 07:50:52,374 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-12-08 07:50:52,374 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 07:50:52,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2018-12-08 07:50:52,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 07:50:52,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:52,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:52,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 07:50:52,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 07:50:52,375 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 306#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.alloc(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; 307#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 308#L14-4 main_~k~0 := 1; 309#L24-3 [2018-12-08 07:50:52,375 INFO L796 eck$LassoCheckResult]: Loop: 309#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 310#L4 assume !(0 == __VERIFIER_assert_~cond); 318#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 316#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 309#L24-3 [2018-12-08 07:50:52,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2018-12-08 07:50:52,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:52,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2018-12-08 07:50:52,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:52,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2018-12-08 07:50:52,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:52,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:50:52,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:50:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 07:50:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 07:50:52,635 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-08 07:50:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:50:52,769 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-12-08 07:50:52,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 07:50:52,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2018-12-08 07:50:52,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 07:50:52,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2018-12-08 07:50:52,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 07:50:52,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 07:50:52,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-12-08 07:50:52,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:50:52,770 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-08 07:50:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-12-08 07:50:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-08 07:50:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 07:50:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-12-08 07:50:52,771 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-12-08 07:50:52,772 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-12-08 07:50:52,772 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 07:50:52,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-12-08 07:50:52,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 07:50:52,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:52,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:52,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:50:52,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 07:50:52,773 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#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.alloc(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; 381#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; 386#L17-5 main_#t~short4 := main_~i~0 >= 0; 372#L17-1 assume !main_#t~short4; 373#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 388#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 389#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 387#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; 375#L17-5 [2018-12-08 07:50:52,773 INFO L796 eck$LassoCheckResult]: Loop: 375#L17-5 main_#t~short4 := main_~i~0 >= 0; 370#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; 371#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 378#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 374#L18-2 main_~i~0 := main_~i~0 - 1; 375#L17-5 [2018-12-08 07:50:52,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2018-12-08 07:50:52,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 07:50:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 07:50:52,791 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 07:50:52,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2018-12-08 07:50:52,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 07:50:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 07:50:52,851 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-08 07:50:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 07:50:52,885 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-12-08 07:50:52,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 07:50:52,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2018-12-08 07:50:52,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 07:50:52,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2018-12-08 07:50:52,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-08 07:50:52,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-08 07:50:52,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2018-12-08 07:50:52,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:50:52,887 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-12-08 07:50:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2018-12-08 07:50:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-12-08 07:50:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-08 07:50:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-12-08 07:50:52,889 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-08 07:50:52,889 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-08 07:50:52,889 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 07:50:52,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2018-12-08 07:50:52,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 07:50:52,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:52,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:52,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 07:50:52,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 07:50:52,891 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 473#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 474#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 479#L17-5 main_#t~short4 := main_~i~0 >= 0; 494#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; 491#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 483#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 484#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 480#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 475#L14-4 main_~k~0 := 1; 476#L24-3 [2018-12-08 07:50:52,891 INFO L796 eck$LassoCheckResult]: Loop: 476#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 477#L4 assume !(0 == __VERIFIER_assert_~cond); 487#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 485#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 476#L24-3 [2018-12-08 07:50:52,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2018-12-08 07:50:52,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:50:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2018-12-08 07:50:52,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2018-12-08 07:50:52,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:52,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:52,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:50:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,118 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2018-12-08 07:50:53,196 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:50:53,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:50:53,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:50:53,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:50:53,196 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:50:53,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:50:53,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:50:53,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:50:53,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration6_Lasso [2018-12-08 07:50:53,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:50:53,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:50:53,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:53,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:50:53,471 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:50:53,471 INFO L122 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 [2018-12-08 07:50:53,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,473 INFO L122 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 [2018-12-08 07:50:53,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,475 INFO L122 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 [2018-12-08 07:50:53,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,475 INFO L122 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 [2018-12-08 07:50:53,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:53,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:53,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,477 INFO L122 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 [2018-12-08 07:50:53,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,478 INFO L122 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 [2018-12-08 07:50:53,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,479 INFO L122 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 [2018-12-08 07:50:53,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,480 INFO L122 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 [2018-12-08 07:50:53,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,481 INFO L122 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 [2018-12-08 07:50:53,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:53,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:53,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:53,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:53,482 INFO L122 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 [2018-12-08 07:50:53,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:53,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:53,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:53,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:53,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:53,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:53,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:50:53,520 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 07:50:53,520 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 07:50:53,521 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:50:53,521 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:50:53,522 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:50:53,522 INFO L520 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 [] [2018-12-08 07:50:53,531 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-08 07:50:53,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 07:50:53,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:53,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:53,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:53,565 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 [2018-12-08 07:50:53,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-12-08 07:50:53,573 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 39 states and 52 transitions. Complement of second has 4 states. [2018-12-08 07:50:53,573 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 [2018-12-08 07:50:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 07:50:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-12-08 07:50:53,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-08 07:50:53,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:53,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-08 07:50:53,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:53,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-08 07:50:53,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:53,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2018-12-08 07:50:53,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 07:50:53,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2018-12-08 07:50:53,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 07:50:53,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 07:50:53,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-12-08 07:50:53,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 07:50:53,576 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-08 07:50:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-12-08 07:50:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-08 07:50:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 07:50:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-12-08 07:50:53,577 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-08 07:50:53,577 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-08 07:50:53,578 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 07:50:53,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2018-12-08 07:50:53,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 07:50:53,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 07:50:53,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 07:50:53,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 07:50:53,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 07:50:53,579 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#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.alloc(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; 620#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; 632#L17-5 main_#t~short4 := main_~i~0 >= 0; 644#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; 640#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 630#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 631#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 633#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; 634#L17-5 main_#t~short4 := main_~i~0 >= 0; 621#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; 622#L17-3 [2018-12-08 07:50:53,579 INFO L796 eck$LassoCheckResult]: Loop: 622#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 637#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 625#L18-2 main_~i~0 := main_~i~0 - 1; 626#L17-5 main_#t~short4 := main_~i~0 >= 0; 639#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; 622#L17-3 [2018-12-08 07:50:53,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2018-12-08 07:50:53,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:53,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 07:50:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2018-12-08 07:50:53,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:53,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:50:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2018-12-08 07:50:53,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 07:50:53,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 07:50:53,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:53,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 07:50:53,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 07:50:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 07:50:53,863 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-12-08 07:50:54,025 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-08 07:50:54,027 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 07:50:54,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 07:50:54,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 07:50:54,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 07:50:54,027 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 07:50:54,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 07:50:54,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 07:50:54,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 07:50:54,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-08 07:50:54,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 07:50:54,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 07:50:54,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,221 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-12-08 07:50:54,382 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-12-08 07:50:54,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 07:50:54,755 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-08 07:50:54,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 07:50:54,760 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 07:50:54,761 INFO L122 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 [2018-12-08 07:50:54,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:54,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:54,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:54,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,762 INFO L122 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 [2018-12-08 07:50:54,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:54,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:54,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:54,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,763 INFO L122 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 [2018-12-08 07:50:54,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:54,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:54,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,764 INFO L122 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 [2018-12-08 07:50:54,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:54,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:54,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:54,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,766 INFO L122 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 [2018-12-08 07:50:54,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 07:50:54,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 07:50:54,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 07:50:54,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,766 INFO L122 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 [2018-12-08 07:50:54,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 07:50:54,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,767 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 07:50:54,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:54,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,768 INFO L122 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 [2018-12-08 07:50:54,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:54,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:54,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 07:50:54,771 INFO L122 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 [2018-12-08 07:50:54,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 07:50:54,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 07:50:54,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 07:50:54,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 07:50:54,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 07:50:54,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 07:50:54,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 07:50:54,778 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 07:50:54,778 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 07:50:54,778 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 07:50:54,779 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 07:50:54,779 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 07:50:54,779 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-08 07:50:54,794 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-12-08 07:50:54,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:54,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:54,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:54,830 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 [2018-12-08 07:50:54,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 07:50:54,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-12-08 07:50:54,860 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 [2018-12-08 07:50:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:50:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-08 07:50:54,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 07:50:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:54,861 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 07:50:54,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:54,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:54,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:54,893 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 [2018-12-08 07:50:54,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 07:50:54,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 55 states and 72 transitions. Complement of second has 9 states. [2018-12-08 07:50:54,920 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 [2018-12-08 07:50:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:50:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-12-08 07:50:54,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 07:50:54,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:54,921 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 07:50:54,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 07:50:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:54,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 07:50:54,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 07:50:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 07:50:54,954 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 [2018-12-08 07:50:54,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 07:50:54,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 65 states and 93 transitions. Complement of second has 8 states. [2018-12-08 07:50:54,984 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 [2018-12-08 07:50:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 07:50:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-12-08 07:50:54,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 07:50:54,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:54,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-08 07:50:54,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:54,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-08 07:50:54,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 07:50:54,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2018-12-08 07:50:54,987 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 07:50:54,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2018-12-08 07:50:54,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 07:50:54,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 07:50:54,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 07:50:54,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 07:50:54,987 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 07:50:54,987 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 07:50:54,988 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 07:50:54,988 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 07:50:54,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 07:50:54,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 07:50:54,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 07:50:54,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 07:50:54 BoogieIcfgContainer [2018-12-08 07:50:54,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 07:50:54,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 07:50:54,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 07:50:54,993 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 07:50:54,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:50:50" (3/4) ... [2018-12-08 07:50:54,996 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 07:50:54,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 07:50:54,996 INFO L168 Benchmark]: Toolchain (without parser) took 4638.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.2 MB). Free memory was 961.3 MB in the beginning and 947.4 MB in the end (delta: 13.9 MB). Peak memory consumption was 278.2 MB. Max. memory is 11.5 GB. [2018-12-08 07:50:54,997 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 07:50:54,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 07:50:54,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-08 07:50:54,998 INFO L168 Benchmark]: Boogie Preprocessor took 20.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-08 07:50:54,998 INFO L168 Benchmark]: RCFGBuilder took 158.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-12-08 07:50:54,999 INFO L168 Benchmark]: BuchiAutomizer took 4274.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 947.4 MB in the end (delta: 129.3 MB). Peak memory consumption was 295.5 MB. Max. memory is 11.5 GB. [2018-12-08 07:50:54,999 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.3 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 07:50:55,001 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4274.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 947.4 MB in the end (delta: 129.3 MB). Peak memory consumption was 295.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.3 GB. Free memory is still 947.4 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 + j and consists of 6 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 4.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 126 SDtfs, 173 SDslu, 86 SDs, 0 SdLazy, 201 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf99 lsp85 ukn82 mio100 lsp68 div189 bol100 ite100 ukn100 eq148 hnf64 smp87 dnf183 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 58ms VariablesStem: 6 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...