./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/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 64bit --witnessprinter.graph.data.programhash 8104a25549f6efe413528ca8cc098e1acad610e4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:01,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:01,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:01,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:01,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:01,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:01,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:01,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:01,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:01,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:01,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:01,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:01,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:01,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:01,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:01,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:01,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:01,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:01,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:01,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:01,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:01,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:01,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:01,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:01,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:01,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:01,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:01,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:01,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:01,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:01,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:01,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:01,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:01,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:01,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:01,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:01,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:01,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:01,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:01,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:01,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:01,296 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:06:01,326 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:01,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:01,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:01,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:01,329 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:01,329 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:06:01,330 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:06:01,330 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:06:01,330 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:06:01,331 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:06:01,332 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:06:01,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:01,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:06:01,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:01,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:01,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:06:01,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:06:01,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:06:01,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:01,336 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:06:01,337 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:01,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:06:01,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:01,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:01,340 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:06:01,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:01,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:01,341 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:06:01,342 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:06:01,342 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2019-11-16 00:06:01,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:01,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:01,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:01,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:01,391 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:01,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-11-16 00:06:01,453 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/data/b62b21f08/f390e7cd206c4737a9b6a83d4f0be543/FLAG5856e947e [2019-11-16 00:06:02,011 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:02,012 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-11-16 00:06:02,034 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/data/b62b21f08/f390e7cd206c4737a9b6a83d4f0be543/FLAG5856e947e [2019-11-16 00:06:02,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/data/b62b21f08/f390e7cd206c4737a9b6a83d4f0be543 [2019-11-16 00:06:02,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:02,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:02,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:02,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:02,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:02,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252ee4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02, skipping insertion in model container [2019-11-16 00:06:02,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,340 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:02,378 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:02,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:02,730 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:02,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:02,850 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:02,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02 WrapperNode [2019-11-16 00:06:02,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:02,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:02,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:02,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:02,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:02,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:02,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:02,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:02,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... [2019-11-16 00:06:02,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:02,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:02,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:02,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:02,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bce9485a-5787-496c-a952-82c6bad088e6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:06:03,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:06:03,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:06:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:06:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:03,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:03,353 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:03,353 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:06:03,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:03 BoogieIcfgContainer [2019-11-16 00:06:03,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:03,355 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:06:03,355 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:06:03,358 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:06:03,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:03,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:06:02" (1/3) ... [2019-11-16 00:06:03,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@135dfe04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:06:03, skipping insertion in model container [2019-11-16 00:06:03,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:03,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:02" (2/3) ... [2019-11-16 00:06:03,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@135dfe04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:06:03, skipping insertion in model container [2019-11-16 00:06:03,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:03,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:03" (3/3) ... [2019-11-16 00:06:03,362 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2019-11-16 00:06:03,408 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:06:03,408 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:06:03,408 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:06:03,408 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:03,408 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:03,408 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:06:03,409 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:03,409 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:06:03,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:06:03,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:06:03,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:03,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:03,455 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:06:03,455 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:06:03,455 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:06:03,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:06:03,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:06:03,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:03,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:03,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:06:03,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:06:03,466 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-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;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; 6#L550-3true [2019-11-16 00:06:03,466 INFO L793 eck$LassoCheckResult]: Loop: 6#L550-3true 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; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2019-11-16 00:06:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:06:03,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715646591] [2019-11-16 00:06:03,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,598 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2019-11-16 00:06:03,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123487335] [2019-11-16 00:06:03,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:03,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123487335] [2019-11-16 00:06:03,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:03,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:03,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25761172] [2019-11-16 00:06:03,640 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:06:03,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:06:03,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:06:03,659 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-16 00:06:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:03,666 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-16 00:06:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:06:03,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-16 00:06:03,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:06:03,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2019-11-16 00:06:03,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:06:03,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:06:03,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-16 00:06:03,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:06:03,674 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:06:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-16 00:06:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-16 00:06:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:06:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-16 00:06:03,701 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:06:03,701 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:06:03,701 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:06:03,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-16 00:06:03,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:06:03,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:03,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:03,703 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:06:03,703 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:06:03,703 INFO L791 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-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;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; 41#L550-3 [2019-11-16 00:06:03,704 INFO L793 eck$LassoCheckResult]: Loop: 41#L550-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; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-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; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2019-11-16 00:06:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-16 00:06:03,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817278344] [2019-11-16 00:06:03,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2019-11-16 00:06:03,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131681447] [2019-11-16 00:06:03,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,766 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2019-11-16 00:06:03,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252545591] [2019-11-16 00:06:03,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:04,006 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-16 00:06:04,145 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-16 00:06:04,313 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:04,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:04,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:04,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:04,316 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:04,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:04,326 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:04,326 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2019-11-16 00:06:04,326 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:04,327 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:04,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,555 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-16 00:06:04,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,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-11-16 00:06:05,087 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:05,094 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:05,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,117 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,118 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,136 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,152 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,152 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,163 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,174 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,175 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,183 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,200 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:06:05,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,204 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:06:05,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,231 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,231 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,236 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,243 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,253 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,353 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:05,449 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:06:05,450 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:05,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:05,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:06:05,459 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:05,460 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-11-16 00:06:05,484 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:06:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:05,586 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:05,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-16 00:06:05,629 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-16 00:06:05,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-16 00:06:05,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-16 00:06:05,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:06:05,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-16 00:06:05,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2019-11-16 00:06:05,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:05,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2019-11-16 00:06:05,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:06:05,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:06:05,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-16 00:06:05,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:05,639 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-16 00:06:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-16 00:06:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-16 00:06:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:06:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-16 00:06:05,641 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-16 00:06:05,642 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-16 00:06:05,642 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:06:05,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-16 00:06:05,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:05,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:05,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:05,644 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:06:05,644 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:06:05,644 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-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;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; 143#L550-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; 135#L553-6 [2019-11-16 00:06:05,644 INFO L793 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-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; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;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; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2019-11-16 00:06:05,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,645 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-16 00:06:05,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540849418] [2019-11-16 00:06:05,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2019-11-16 00:06:05,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031487762] [2019-11-16 00:06:05,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2019-11-16 00:06:05,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772760285] [2019-11-16 00:06:05,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:05,823 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-11-16 00:06:06,004 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-11-16 00:06:06,067 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:06,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:06,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:06,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:06,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:06,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:06,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:06,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:06,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2019-11-16 00:06:06,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:06,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:06,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,225 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-16 00:06:06,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,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-11-16 00:06:06,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,626 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:06,626 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:06,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-11-16 00:06:06,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:06,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:06,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:06,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:06,630 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:06,630 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:06,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:06,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:06,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:06,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:06,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:06,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:06,657 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:06,657 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:06,691 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:06,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:06,709 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:06,710 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:06,711 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:06:06,711 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:06,712 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-16 00:06:06,728 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:06:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:06,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:06,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:06,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:06:06,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:06,824 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:06:06,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-16 00:06:06,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2019-11-16 00:06:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:06:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-16 00:06:06,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:06:06,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:06:06,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-16 00:06:06,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-11-16 00:06:06,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:06,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2019-11-16 00:06:06,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:06:06,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:06:06,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-16 00:06:06,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:06,897 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-16 00:06:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-16 00:06:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-11-16 00:06:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:06:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-16 00:06:06,904 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-16 00:06:06,904 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-16 00:06:06,904 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:06:06,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-16 00:06:06,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:06,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:06,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:06,910 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:06,910 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:06:06,910 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-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;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; 277#L550-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; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-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; 269#L553-6 [2019-11-16 00:06:06,911 INFO L793 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-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; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;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; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2019-11-16 00:06:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2019-11-16 00:06:06,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:06,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535469223] [2019-11-16 00:06:06,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:07,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535469223] [2019-11-16 00:06:07,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:07,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:07,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663681025] [2019-11-16 00:06:07,004 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:06:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2019-11-16 00:06:07,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:07,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212836421] [2019-11-16 00:06:07,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,020 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:07,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:07,123 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-16 00:06:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:07,194 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-16 00:06:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:07,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-16 00:06:07,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:07,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-16 00:06:07,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:06:07,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:06:07,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-16 00:06:07,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:07,198 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-16 00:06:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-16 00:06:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-11-16 00:06:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:06:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-16 00:06:07,201 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-16 00:06:07,201 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-16 00:06:07,201 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:06:07,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-16 00:06:07,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:07,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:07,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:07,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:07,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:06:07,204 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 342#L560 assume !(main_~array_size~0 < 1); 343#L560-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;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; 344#L550-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; 346#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 347#L553-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; 352#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 353#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 339#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 340#L550-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; 336#L553-6 [2019-11-16 00:06:07,204 INFO L793 eck$LassoCheckResult]: Loop: 336#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 345#L553-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; 351#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;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; 335#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 336#L553-6 [2019-11-16 00:06:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2019-11-16 00:06:07,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:07,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186182020] [2019-11-16 00:06:07,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,254 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2019-11-16 00:06:07,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:07,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171133375] [2019-11-16 00:06:07,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,275 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2019-11-16 00:06:07,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:07,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682788491] [2019-11-16 00:06:07,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:07,328 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:07,801 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 90 [2019-11-16 00:06:07,891 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:07,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:07,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:07,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:07,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:07,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:07,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:07,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:07,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2019-11-16 00:06:07,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:07,892 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:07,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:07,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,102 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-11-16 00:06:08,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-11-16 00:06:08,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,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-11-16 00:06:08,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-11-16 00:06:08,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:08,545 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:08,546 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:08,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:08,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:08,547 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:08,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:08,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:08,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:08,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:08,548 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:08,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:08,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:08,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:08,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:08,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:08,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:08,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:08,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:08,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:08,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:08,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:08,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:08,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:08,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:08,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:08,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:08,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:08,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:08,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:08,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:08,559 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:06:08,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:08,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:08,561 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:06:08,561 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:08,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:08,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:08,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:08,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:08,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:08,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:08,570 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:08,570 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:08,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:08,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:08,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:08,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:08,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:08,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:08,579 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:08,579 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:08,602 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:08,610 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:08,610 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:08,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:08,612 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:06:08,612 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:08,612 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-16 00:06:08,633 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-16 00:06:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:08,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:06:08,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:08,708 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:06:08,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:06:08,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-11-16 00:06:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:06:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-16 00:06:08,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:06:08,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:08,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:06:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:08,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:06:08,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:08,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:06:08,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:06:08,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-11-16 00:06:08,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:06:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-16 00:06:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:06:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:08,875 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:06:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:08,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:06:08,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:08,948 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:06:08,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-16 00:06:08,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2019-11-16 00:06:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:06:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-16 00:06:09,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:06:09,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:09,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-16 00:06:09,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:09,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-16 00:06:09,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:09,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2019-11-16 00:06:09,006 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:06:09,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2019-11-16 00:06:09,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:06:09,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:06:09,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:06:09,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:06:09,006 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:09,007 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:09,007 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:09,007 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:06:09,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:06:09,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:06:09,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:06:09,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:06:09 BoogieIcfgContainer [2019-11-16 00:06:09,019 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:06:09,020 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:06:09,020 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:06:09,020 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:06:09,021 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:03" (3/4) ... [2019-11-16 00:06:09,025 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:06:09,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:06:09,027 INFO L168 Benchmark]: Toolchain (without parser) took 6700.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 939.4 MB in the beginning and 996.6 MB in the end (delta: -57.2 MB). Peak memory consumption was 135.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:09,028 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:09,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:09,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:09,032 INFO L168 Benchmark]: Boogie Preprocessor took 46.13 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-11-16 00:06:09,039 INFO L168 Benchmark]: RCFGBuilder took 408.36 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-11-16 00:06:09,040 INFO L168 Benchmark]: BuchiAutomizer took 5663.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 104.6 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:09,040 INFO L168 Benchmark]: Witness Printer took 5.37 ms. Allocated memory is still 1.2 GB. Free memory is still 996.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:09,043 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.13 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 408.36 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 5663.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 104.6 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.37 ms. Allocated memory is still 1.2 GB. Free memory is still 996.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 116 SDslu, 43 SDs, 0 SdLazy, 130 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax110 hnf99 lsp86 ukn77 mio100 lsp64 div100 bol100 ite100 ukn100 eq180 hnf82 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...