./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c42e17875debafbb946353bbf5dda6a0b0ba9b37 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:49,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:49,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:49,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:49,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:49,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:49,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:49,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:49,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:49,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:49,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:49,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:49,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:49,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:49,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:49,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:49,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:49,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:49,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:49,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:49,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:49,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:49,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:49,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:49,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:49,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:49,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:49,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:49,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:49,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:49,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:49,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:49,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:49,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:49,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:49,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:49,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:49,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:49,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:49,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:49,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:49,345 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:49,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:49,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:49,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:49,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:49,358 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:49,359 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:49,359 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:49,359 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:49,359 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:49,359 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:49,360 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:49,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:49,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:49,360 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:49,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:49,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:49,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:49,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:49,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:49,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:49,361 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:49,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:49,362 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:49,362 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:49,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:49,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:49,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:49,363 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:49,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:49,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:49,363 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:49,364 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:49,365 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c42e17875debafbb946353bbf5dda6a0b0ba9b37 [2019-10-22 08:59:49,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:49,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:49,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:49,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:49,401 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:49,402 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2019-10-22 08:59:49,443 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/data/0e96f0b1d/a081e06206b84b60887b2a60ea71f541/FLAG826fba36e [2019-10-22 08:59:49,878 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:49,882 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2019-10-22 08:59:49,894 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/data/0e96f0b1d/a081e06206b84b60887b2a60ea71f541/FLAG826fba36e [2019-10-22 08:59:49,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/data/0e96f0b1d/a081e06206b84b60887b2a60ea71f541 [2019-10-22 08:59:49,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:49,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:49,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:49,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:49,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:49,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58628272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49, skipping insertion in model container [2019-10-22 08:59:49,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:49,963 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:50,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:50,315 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:50,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:50,403 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:50,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50 WrapperNode [2019-10-22 08:59:50,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:50,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:50,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:50,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:50,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:50,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:50,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:50,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:50,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:50,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:50,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:50,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:50,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:50,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:50,698 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:50,698 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:59:50,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:50 BoogieIcfgContainer [2019-10-22 08:59:50,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:50,700 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:50,700 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:50,703 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:50,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:50,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:49" (1/3) ... [2019-10-22 08:59:50,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66b002d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:50, skipping insertion in model container [2019-10-22 08:59:50,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:50,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (2/3) ... [2019-10-22 08:59:50,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66b002d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:50, skipping insertion in model container [2019-10-22 08:59:50,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:50,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:50" (3/3) ... [2019-10-22 08:59:50,715 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-1.i [2019-10-22 08:59:50,763 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:50,763 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:50,763 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:50,763 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:50,763 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:50,763 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:50,763 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:50,763 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:50,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:59:50,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:59:50,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:50,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:50,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:50,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:50,803 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:50,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:59:50,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:59:50,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:50,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:50,805 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:50,805 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:50,832 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 6#L525true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L525-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 20#L530-3true [2019-10-22 08:59:50,832 INFO L793 eck$LassoCheckResult]: Loop: 20#L530-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 17#L530-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 20#L530-3true [2019-10-22 08:59:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:59:50,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969163046] [2019-10-22 08:59:50,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:59:50,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349847426] [2019-10-22 08:59:50,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:59:50,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510594715] [2019-10-22 08:59:50,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,136 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:51,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:51,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:51,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:51,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:51,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:51,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:51,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:51,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration1_Lasso [2019-10-22 08:59:51,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:51,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:51,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,487 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:51,491 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:51,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,503 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,504 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,521 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,522 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,547 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,548 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,569 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,569 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,575 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,575 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,586 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,586 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,590 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:51,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,593 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:51,593 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,611 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,612 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:51,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,631 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,709 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:51,755 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:51,756 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:51,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:51,759 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:51,759 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:51,760 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1, ULTIMATE.start_main_~a~0.offset) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2019-10-22 08:59:51,768 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:51,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:51,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:51,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 08:59:51,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 44 states and 62 transitions. Complement of second has 7 states. [2019-10-22 08:59:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2019-10-22 08:59:51,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:59:51,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:59:51,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:59:51,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2019-10-22 08:59:51,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:51,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 15 states and 20 transitions. [2019-10-22 08:59:51,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:51,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:59:51,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 08:59:51,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:51,926 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:59:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 08:59:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:59:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 08:59:51,952 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:59:51,952 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:59:51,952 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:51,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 08:59:51,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:51,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:51,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:51,953 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:51,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:51,954 INFO L791 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 124#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 125#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 128#L530-3 assume !(main_~i~1 < main_~array_size~0); 119#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 120#L515-3 [2019-10-22 08:59:51,954 INFO L793 eck$LassoCheckResult]: Loop: 120#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 126#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 129#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 121#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 122#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 127#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 120#L515-3 [2019-10-22 08:59:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 08:59:51,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036067358] [2019-10-22 08:59:51,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:51,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036067358] [2019-10-22 08:59:51,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:51,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:51,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193259348] [2019-10-22 08:59:52,000 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 1 times [2019-10-22 08:59:52,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213371481] [2019-10-22 08:59:52,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,026 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,132 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-10-22 08:59:52,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:52,171 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:59:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:52,201 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-10-22 08:59:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:52,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-10-22 08:59:52,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:52,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 08:59:52,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:59:52,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:59:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-10-22 08:59:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:52,205 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:59:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-10-22 08:59:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 08:59:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 08:59:52,208 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:59:52,208 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:59:52,208 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:52,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 08:59:52,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:52,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:52,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:52,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,210 INFO L791 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 162#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 163#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 166#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 170#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 171#L530-3 assume !(main_~i~1 < main_~array_size~0); 157#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 158#L515-3 [2019-10-22 08:59:52,210 INFO L793 eck$LassoCheckResult]: Loop: 158#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 164#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 167#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 159#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 160#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 165#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 158#L515-3 [2019-10-22 08:59:52,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 08:59:52,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414649444] [2019-10-22 08:59:52,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 2 times [2019-10-22 08:59:52,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747536324] [2019-10-22 08:59:52,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -259891877, now seen corresponding path program 1 times [2019-10-22 08:59:52,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700909728] [2019-10-22 08:59:52,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:52,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700909728] [2019-10-22 08:59:52,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216109770] [2019-10-22 08:59:52,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:52,498 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:52,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-22 08:59:52,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884203058] [2019-10-22 08:59:52,603 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-22 08:59:52,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:52,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:59:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:59:52,657 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-10-22 08:59:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:52,832 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-10-22 08:59:52,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:52,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 08:59:52,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:52,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-10-22 08:59:52,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:59:52,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:59:52,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:59:52,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:52,834 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:59:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:59:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:59:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:59:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:59:52,836 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:59:52,836 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:59:52,836 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:52,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:59:52,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:59:52,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:52,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:52,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,837 INFO L791 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 268#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 262#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 263#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 266#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 270#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 271#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 272#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 273#L530-3 assume !(main_~i~1 < main_~array_size~0); 257#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 258#L515-3 [2019-10-22 08:59:52,837 INFO L793 eck$LassoCheckResult]: Loop: 258#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 265#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 267#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 259#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 260#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 264#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 258#L515-3 [2019-10-22 08:59:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-10-22 08:59:52,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447436934] [2019-10-22 08:59:52,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,871 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 3 times [2019-10-22 08:59:52,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230478799] [2019-10-22 08:59:52,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,888 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:52,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1804388285, now seen corresponding path program 2 times [2019-10-22 08:59:52,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219023523] [2019-10-22 08:59:52,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:52,942 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:53,237 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-10-22 08:59:53,294 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:53,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:53,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:53,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:53,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:53,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:53,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:53,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:53,295 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration4_Lasso [2019-10-22 08:59:53,295 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:53,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:53,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:53,784 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:53,785 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:53,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,792 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,797 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,813 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,815 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,815 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,816 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,816 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,824 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,832 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:53,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,834 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:53,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,843 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,844 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,844 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,853 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,853 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,907 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:53,939 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:53,940 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:53,940 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:53,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:53,941 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:53,941 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2019-10-22 08:59:53,961 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:54,030 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:54,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:59:54,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 31 transitions. Complement of second has 4 states. [2019-10-22 08:59:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:59:54,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:59:54,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:54,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 16 letters. Loop has 6 letters. [2019-10-22 08:59:54,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:54,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 12 letters. [2019-10-22 08:59:54,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:54,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-10-22 08:59:54,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:54,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-10-22 08:59:54,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:54,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:54,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-10-22 08:59:54,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:54,047 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 08:59:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-10-22 08:59:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-22 08:59:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:59:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-22 08:59:54,049 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-22 08:59:54,049 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-22 08:59:54,049 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:54,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-10-22 08:59:54,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:54,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:54,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:54,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:54,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:54,054 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 407#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 398#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 399#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 404#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 409#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 410#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 411#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 412#L530-3 assume !(main_~i~1 < main_~array_size~0); 391#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 392#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 400#L518-6 [2019-10-22 08:59:54,055 INFO L793 eck$LassoCheckResult]: Loop: 400#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 405#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 393#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 394#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 400#L518-6 [2019-10-22 08:59:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-10-22 08:59:54,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37617509] [2019-10-22 08:59:54,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 1 times [2019-10-22 08:59:54,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653718742] [2019-10-22 08:59:54,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,095 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1166584787, now seen corresponding path program 1 times [2019-10-22 08:59:54,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494642896] [2019-10-22 08:59:54,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:54,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,412 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-10-22 08:59:54,484 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:54,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:54,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:54,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:54,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:54,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:54,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:54,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:54,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration5_Lasso [2019-10-22 08:59:54,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:54,485 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:54,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,907 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:54,908 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:54,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,909 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:54,910 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:54,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:54,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:54,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:54,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:54,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:54,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:54,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,917 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:54,917 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:54,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,919 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:54,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,920 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:54,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:54,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:54,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:54,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,927 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:54,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,928 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:54,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:54,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:54,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:54,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:54,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:54,953 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:54,976 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:54,977 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:59:54,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:54,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:54,978 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:54,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-10-22 08:59:54,998 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:59:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:55,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:59:55,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:55,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:55,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-10-22 08:59:55,094 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 53 states and 68 transitions. Complement of second has 9 states. [2019-10-22 08:59:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-10-22 08:59:55,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 08:59:55,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:55,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 08:59:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 08:59:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:55,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. [2019-10-22 08:59:55,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 46 transitions. [2019-10-22 08:59:55,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:55,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:55,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-10-22 08:59:55,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:55,099 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-10-22 08:59:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-10-22 08:59:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-10-22 08:59:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:59:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-10-22 08:59:55,102 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 08:59:55,102 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 08:59:55,103 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:55,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-10-22 08:59:55,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,104 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:55,104 INFO L791 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 572#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 561#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 562#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 568#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 574#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 575#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 577#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 578#L530-3 assume !(main_~i~1 < main_~array_size~0); 555#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 556#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 565#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 576#L518-1 assume !insertionSort_#t~short6; 559#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 560#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 566#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 567#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 563#L518-6 [2019-10-22 08:59:55,104 INFO L793 eck$LassoCheckResult]: Loop: 563#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 570#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 557#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 558#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 563#L518-6 [2019-10-22 08:59:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash 103309060, now seen corresponding path program 1 times [2019-10-22 08:59:55,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832344625] [2019-10-22 08:59:55,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:59:55,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832344625] [2019-10-22 08:59:55,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:55,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:55,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623265193] [2019-10-22 08:59:55,129 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 2 times [2019-10-22 08:59:55,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202525609] [2019-10-22 08:59:55,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,135 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:55,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:55,203 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-10-22 08:59:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,242 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-10-22 08:59:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:55,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-10-22 08:59:55,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-10-22 08:59:55,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:55,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:55,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-10-22 08:59:55,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:55,244 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-10-22 08:59:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-10-22 08:59:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-10-22 08:59:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:59:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-10-22 08:59:55,247 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 08:59:55,247 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 08:59:55,247 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:55,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-10-22 08:59:55,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:55,248 INFO L791 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 640#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 641#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 647#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 657#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 658#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 654#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 655#L530-3 assume !(main_~i~1 < main_~array_size~0); 634#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 635#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 648#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 660#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 659#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 651#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 645#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 646#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 642#L518-6 [2019-10-22 08:59:55,248 INFO L793 eck$LassoCheckResult]: Loop: 642#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 649#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 636#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 637#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 642#L518-6 [2019-10-22 08:59:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash 101462018, now seen corresponding path program 3 times [2019-10-22 08:59:55,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371999684] [2019-10-22 08:59:55,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:55,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371999684] [2019-10-22 08:59:55,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797195396] [2019-10-22 08:59:55,323 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0773ee16-d3e6-46d3-a1b0-2c607a67a3b7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:55,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 08:59:55,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:59:55,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:59:55,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:55,426 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:55,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-10-22 08:59:55,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013335943] [2019-10-22 08:59:55,427 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 3 times [2019-10-22 08:59:55,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243693916] [2019-10-22 08:59:55,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:59:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:59:55,512 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 14 states. [2019-10-22 08:59:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,636 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-10-22 08:59:55,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:55,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2019-10-22 08:59:55,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 34 states and 43 transitions. [2019-10-22 08:59:55,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:55,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:55,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-10-22 08:59:55,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:55,640 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-10-22 08:59:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-10-22 08:59:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-22 08:59:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:59:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-10-22 08:59:55,642 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-10-22 08:59:55,642 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-10-22 08:59:55,642 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:55,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2019-10-22 08:59:55,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,643 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,643 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:55,643 INFO L791 eck$LassoCheckResult]: Stem: 803#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 802#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 790#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 791#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 797#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 808#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 816#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 804#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 805#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 809#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 810#L530-3 assume !(main_~i~1 < main_~array_size~0); 784#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 785#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 800#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 806#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 807#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 801#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 792#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 793#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 794#L518-6 [2019-10-22 08:59:55,644 INFO L793 eck$LassoCheckResult]: Loop: 794#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 798#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 786#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 787#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 794#L518-6 [2019-10-22 08:59:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1730024032, now seen corresponding path program 4 times [2019-10-22 08:59:55,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394235683] [2019-10-22 08:59:55,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,673 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 4 times [2019-10-22 08:59:55,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895046242] [2019-10-22 08:59:55,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,683 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1424072763, now seen corresponding path program 1 times [2019-10-22 08:59:55,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014614409] [2019-10-22 08:59:55,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,709 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:56,231 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 129 [2019-10-22 08:59:56,331 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:56,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:56,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:56,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:56,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:56,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:56,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:56,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:56,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration8_Lasso [2019-10-22 08:59:56,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:56,331 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:56,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,400 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 08:59:56,403 INFO L168 Benchmark]: Toolchain (without parser) took 6493.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 941.0 MB in the beginning and 1.0 GB in the end (delta: -89.0 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,403 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:56,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,404 INFO L168 Benchmark]: Boogie Preprocessor took 22.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,405 INFO L168 Benchmark]: RCFGBuilder took 237.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,405 INFO L168 Benchmark]: BuchiAutomizer took 5701.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.1 MB). Peak memory consumption was 120.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:56,408 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 237.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5701.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.1 MB). Peak memory consumption was 120.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...