./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.23-1dbac8b [2018-11-10 06:01:49,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:01:49,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:01:49,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:01:49,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:01:49,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:01:49,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:01:49,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:01:49,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:01:49,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:01:49,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:01:49,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:01:49,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:01:49,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:01:49,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:01:49,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:01:49,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:01:49,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:01:49,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:01:49,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:01:49,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:01:49,958 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:01:49,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:01:49,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:01:49,960 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:01:49,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:01:49,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:01:49,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:01:49,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:01:49,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:01:49,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:01:49,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:01:49,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:01:49,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:01:49,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:01:49,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:01:49,965 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 06:01:49,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:01:49,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:01:49,977 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:01:49,977 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:01:49,977 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:01:49,977 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:01:49,977 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:01:49,978 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:01:49,978 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:01:49,978 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:01:49,978 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:01:49,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:01:49,978 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:01:49,978 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:01:49,979 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:01:49,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:01:49,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:01:49,980 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:01:49,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:01:49,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:01:49,980 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:01:49,981 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:01:49,981 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2018-11-10 06:01:50,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:01:50,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:01:50,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:01:50,020 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:01:50,020 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:01:50,021 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2018-11-10 06:01:50,066 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/data/ad8687136/0e3574de648c4e2daf08c0e6dc6261f6/FLAGb1abfa5b2 [2018-11-10 06:01:50,495 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:01:50,495 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2018-11-10 06:01:50,502 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/data/ad8687136/0e3574de648c4e2daf08c0e6dc6261f6/FLAGb1abfa5b2 [2018-11-10 06:01:50,510 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/data/ad8687136/0e3574de648c4e2daf08c0e6dc6261f6 [2018-11-10 06:01:50,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:01:50,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:01:50,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:01:50,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:01:50,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:01:50,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50, skipping insertion in model container [2018-11-10 06:01:50,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:01:50,555 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:01:50,737 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:01:50,744 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:01:50,769 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:01:50,798 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:01:50,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50 WrapperNode [2018-11-10 06:01:50,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:01:50,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:01:50,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:01:50,800 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:01:50,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:01:50,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:01:50,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:01:50,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:01:50,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... [2018-11-10 06:01:50,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:01:50,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:01:50,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:01:50,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:01:50,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:01:50,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:01:50,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:01:50,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:01:50,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:01:51,075 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:01:51,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:51 BoogieIcfgContainer [2018-11-10 06:01:51,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:01:51,076 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:01:51,076 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:01:51,079 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:01:51,080 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:01:51,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:01:50" (1/3) ... [2018-11-10 06:01:51,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b2050e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:01:51, skipping insertion in model container [2018-11-10 06:01:51,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:01:51,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:50" (2/3) ... [2018-11-10 06:01:51,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b2050e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:01:51, skipping insertion in model container [2018-11-10 06:01:51,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:01:51,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:51" (3/3) ... [2018-11-10 06:01:51,083 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-termination.c.i [2018-11-10 06:01:51,115 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:01:51,115 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:01:51,115 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:01:51,115 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:01:51,115 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:01:51,116 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:01:51,116 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:01:51,116 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:01:51,116 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:01:51,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 06:01:51,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 06:01:51,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:51,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:51,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 06:01:51,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,144 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:01:51,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 06:01:51,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 06:01:51,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:51,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:51,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 06:01:51,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,153 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 23#L560true assume !(main_~array_size~0 < 1); 4#L560-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 5#L550-3true [2018-11-10 06:01:51,153 INFO L795 eck$LassoCheckResult]: Loop: 5#L550-3true assume true; 25#L550-1true assume !!(insertionSort_~i~0 < insertionSort_~array_size); 16#L552true SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 19#L552-1true insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-8true assume !true; 10#L553-9true SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L553-9 9#L555true insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 5#L550-3true [2018-11-10 06:01:51,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 06:01:51,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 928967495, now seen corresponding path program 1 times [2018-11-10 06:01:51,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:51,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:51,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:01:51,265 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:01:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:01:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:01:51,275 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 06:01:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:51,279 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 06:01:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:01:51,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 06:01:51,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 06:01:51,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 06:01:51,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 06:01:51,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 06:01:51,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 06:01:51,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:51,285 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 06:01:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 06:01:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 06:01:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 06:01:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 06:01:51,302 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 06:01:51,302 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 06:01:51,302 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:01:51,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 06:01:51,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 06:01:51,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:51,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:51,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 06:01:51,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,304 INFO L793 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 66#L560 assume !(main_~array_size~0 < 1); 57#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 58#L550-3 [2018-11-10 06:01:51,304 INFO L795 eck$LassoCheckResult]: Loop: 58#L550-3 assume true; 59#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 69#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 70#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 61#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 62#L553-1 assume !insertionSort_#t~short6; 54#L553-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 55#L553-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L553-9 63#L555 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 58#L550-3 [2018-11-10 06:01:51,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 06:01:51,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash -634363177, now seen corresponding path program 1 times [2018-11-10 06:01:51,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2147345267, now seen corresponding path program 1 times [2018-11-10 06:01:51,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:51,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:51,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:01:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:01:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:01:51,535 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-10 06:01:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:51,647 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-10 06:01:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:01:51,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2018-11-10 06:01:51,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2018-11-10 06:01:51,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2018-11-10 06:01:51,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 06:01:51,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 06:01:51,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2018-11-10 06:01:51,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:51,650 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-10 06:01:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2018-11-10 06:01:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 25. [2018-11-10 06:01:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 06:01:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 06:01:51,652 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 06:01:51,652 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 06:01:51,652 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:01:51,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-11-10 06:01:51,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 06:01:51,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:51,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:51,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,653 INFO L793 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 151#L560 assume !(main_~array_size~0 < 1); 141#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 142#L550-3 assume true; 162#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 161#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 160#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 159#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 156#L553-1 assume insertionSort_#t~short6; 157#L553-2 [2018-11-10 06:01:51,653 INFO L795 eck$LassoCheckResult]: Loop: 157#L553-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L553-2 158#L553-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 138#L553-5 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 140#L554 SUMMARY for call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L554 149#L554-1 SUMMARY for call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L554-1 152#L554-2 havoc insertionSort_#t~mem7; 145#L553-7 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 146#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 147#L553-1 assume insertionSort_#t~short6; 157#L553-2 [2018-11-10 06:01:51,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2015135634, now seen corresponding path program 1 times [2018-11-10 06:01:51,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash -660683095, now seen corresponding path program 1 times [2018-11-10 06:01:51,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash -261654308, now seen corresponding path program 1 times [2018-11-10 06:01:51,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:51,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:51,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:01:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:51,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:51,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:01:51,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 06:01:51,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:01:51,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:01:51,887 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 06:01:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:51,969 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-10 06:01:51,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:01:51,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 52 transitions. [2018-11-10 06:01:51,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 06:01:51,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 52 transitions. [2018-11-10 06:01:51,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 06:01:51,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 06:01:51,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 52 transitions. [2018-11-10 06:01:51,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:51,974 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 06:01:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 52 transitions. [2018-11-10 06:01:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-11-10 06:01:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 06:01:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 06:01:51,980 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 06:01:51,980 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 06:01:51,980 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:01:51,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2018-11-10 06:01:51,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 06:01:51,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:51,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:51,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:51,981 INFO L793 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 297#L560 assume !(main_~array_size~0 < 1); 286#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 287#L550-3 assume true; 318#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 317#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 306#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 307#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 312#L553-1 assume insertionSort_#t~short6; 313#L553-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L553-2 310#L553-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 311#L553-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L553-9 [2018-11-10 06:01:51,982 INFO L795 eck$LassoCheckResult]: Loop: 285#L553-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L553-9 293#L555 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 288#L550-3 assume true; 289#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 302#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 303#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 291#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 292#L553-1 assume !insertionSort_#t~short6; 284#L553-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L553-9 [2018-11-10 06:01:51,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2147218836, now seen corresponding path program 1 times [2018-11-10 06:01:51,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:51,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:51,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:51,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:52,003 INFO L82 PathProgramCache]: Analyzing trace with hash -498385261, now seen corresponding path program 2 times [2018-11-10 06:01:52,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:52,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:52,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1138827680, now seen corresponding path program 1 times [2018-11-10 06:01:52,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:52,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:52,088 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5450b77d-f722-479c-aa16-66b970acf38b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:01:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:52,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:52,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:01:52,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-11-10 06:01:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 06:01:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:01:52,250 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 06:01:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:52,438 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-10 06:01:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:01:52,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 69 transitions. [2018-11-10 06:01:52,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-10 06:01:52,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 69 transitions. [2018-11-10 06:01:52,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 06:01:52,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-10 06:01:52,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 69 transitions. [2018-11-10 06:01:52,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:52,442 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-11-10 06:01:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 69 transitions. [2018-11-10 06:01:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2018-11-10 06:01:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 06:01:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-10 06:01:52,445 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 06:01:52,445 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 06:01:52,446 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:01:52,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 51 transitions. [2018-11-10 06:01:52,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 06:01:52,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:52,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:52,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:52,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:52,449 INFO L793 eck$LassoCheckResult]: Stem: 493#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 490#L560 assume !(main_~array_size~0 < 1); 479#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 480#L550-3 assume true; 522#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 521#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 520#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 519#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 517#L553-1 assume insertionSort_#t~short6; 516#L553-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L553-2 515#L553-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 514#L553-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 478#L553-9 [2018-11-10 06:01:52,449 INFO L795 eck$LassoCheckResult]: Loop: 478#L553-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L553-9 486#L555 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 481#L550-3 assume true; 482#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 494#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 495#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 499#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 518#L553-1 assume insertionSort_#t~short6; 500#L553-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L553-2 501#L553-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 504#L553-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 478#L553-9 [2018-11-10 06:01:52,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2147218836, now seen corresponding path program 2 times [2018-11-10 06:01:52,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:52,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2087976374, now seen corresponding path program 1 times [2018-11-10 06:01:52,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:52,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:52,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:52,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 803135043, now seen corresponding path program 1 times [2018-11-10 06:01:52,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:52,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:52,760 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2018-11-10 06:01:52,811 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:01:52,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:01:52,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:01:52,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:01:52,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:01:52,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:01:52,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:01:52,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:01:52,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 06:01:52,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:01:52,813 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:01:52,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:52,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,278 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:01:53,283 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:01:53,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:53,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:53,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:53,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:53,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:53,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:53,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:53,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:53,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:53,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:53,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:53,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:53,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:53,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:53,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:53,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:53,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:53,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:53,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:53,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:53,381 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:01:53,407 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 06:01:53,408 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 06:01:53,410 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:01:53,411 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:01:53,411 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:01:53,412 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0, v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1) = -1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 Supporting invariants [] [2018-11-10 06:01:53,431 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 06:01:53,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:01:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:53,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:53,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:53,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 06:01:53,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 51 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-10 06:01:53,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 51 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 75 states and 84 transitions. Complement of second has 6 states. [2018-11-10 06:01:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:01:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 06:01:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-10 06:01:53,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-10 06:01:53,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:53,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-10 06:01:53,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:53,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 13 letters. Loop has 22 letters. [2018-11-10 06:01:53,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:53,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 84 transitions. [2018-11-10 06:01:53,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 06:01:53,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 74 transitions. [2018-11-10 06:01:53,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 06:01:53,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:01:53,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 74 transitions. [2018-11-10 06:01:53,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:01:53,553 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-10 06:01:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 74 transitions. [2018-11-10 06:01:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-10 06:01:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 06:01:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-10 06:01:53,555 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 06:01:53,555 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 06:01:53,555 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:01:53,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2018-11-10 06:01:53,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 06:01:53,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:01:53,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:01:53,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:53,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:53,557 INFO L793 eck$LassoCheckResult]: Stem: 743#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 738#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 739#L560 assume !(main_~array_size~0 < 1); 722#L560-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 723#L550-3 assume true; 724#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 749#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 750#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 753#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 769#L553-1 assume insertionSort_#t~short6; 755#L553-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L553-2 756#L553-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 759#L553-5 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 734#L553-9 SUMMARY for call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L553-9 733#L555 insertionSort_#t~pre2 := insertionSort_~i~0 + 1;insertionSort_~i~0 := insertionSort_~i~0 + 1;havoc insertionSort_#t~pre2; 725#L550-3 assume true; 726#L550-1 assume !!(insertionSort_~i~0 < insertionSort_~array_size); 751#L552 SUMMARY for call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~i~0 * 4, 4); srcloc: L552 752#L552-1 insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 728#L553-8 [2018-11-10 06:01:53,557 INFO L795 eck$LassoCheckResult]: Loop: 728#L553-8 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 731#L553-1 assume insertionSort_#t~short6; 765#L553-2 SUMMARY for call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L553-2 764#L553-3 insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 718#L553-5 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 719#L554 SUMMARY for call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + (insertionSort_~j~0 - 1) * 4, 4); srcloc: L554 735#L554-1 SUMMARY for call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + insertionSort_~j~0 * 4, 4); srcloc: L554-1 740#L554-2 havoc insertionSort_#t~mem7; 727#L553-7 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 728#L553-8 [2018-11-10 06:01:53,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1800144356, now seen corresponding path program 2 times [2018-11-10 06:01:53,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:53,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:53,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:53,575 INFO L82 PathProgramCache]: Analyzing trace with hash -868623101, now seen corresponding path program 2 times [2018-11-10 06:01:53,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:53,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:53,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:53,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1293816136, now seen corresponding path program 1 times [2018-11-10 06:01:53,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:01:53,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:01:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:53,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:01:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:01:53,865 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 99 [2018-11-10 06:01:53,916 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:01:53,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:01:53,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:01:53,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:01:53,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:01:53,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:01:53,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:01:53,917 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:01:53,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 06:01:53,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:01:53,917 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:01:53,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:53,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:54,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:54,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:54,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:54,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:54,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:01:54,319 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:01:54,319 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:01:54,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:54,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:54,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:54,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:54,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:54,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:54,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:01:54,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:01:54,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:01:54,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:54,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:54,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:01:54,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:01:54,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:01:54,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:01:54,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:01:54,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:01:54,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:01:54,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:01:54,372 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:01:54,412 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 06:01:54,412 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 06:01:54,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:01:54,413 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:01:54,414 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:01:54,414 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-10 06:01:54,437 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 06:01:54,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:54,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:54,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:54,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 06:01:54,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 06:01:54,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-11-10 06:01:54,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 06:01:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 06:01:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-10 06:01:54,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 06:01:54,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:54,526 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:01:54,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:54,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:54,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:54,571 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 06:01:54,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 06:01:54,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-11-10 06:01:54,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 06:01:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 06:01:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-10 06:01:54,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 06:01:54,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:54,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:01:54,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:54,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:54,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:54,654 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 06:01:54,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 06:01:54,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 63 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 125 states and 135 transitions. Complement of second has 10 states. [2018-11-10 06:01:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 06:01:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 06:01:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-10 06:01:54,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 06:01:54,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:54,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 28 letters. Loop has 9 letters. [2018-11-10 06:01:54,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:54,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 19 letters. Loop has 18 letters. [2018-11-10 06:01:54,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:01:54,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 135 transitions. [2018-11-10 06:01:54,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:01:54,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 0 states and 0 transitions. [2018-11-10 06:01:54,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:01:54,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:01:54,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:01:54,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:01:54,738 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:01:54,738 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:01:54,738 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:01:54,738 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:01:54,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:01:54,738 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:01:54,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:01:54,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:01:54 BoogieIcfgContainer [2018-11-10 06:01:54,746 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:01:54,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:01:54,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:01:54,746 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:01:54,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:51" (3/4) ... [2018-11-10 06:01:54,750 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:01:54,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:01:54,750 INFO L168 Benchmark]: Toolchain (without parser) took 4238.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -256.4 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:54,751 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:01:54,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.96 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:54,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:54,752 INFO L168 Benchmark]: Boogie Preprocessor took 14.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:01:54,753 INFO L168 Benchmark]: RCFGBuilder took 194.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:54,753 INFO L168 Benchmark]: BuchiAutomizer took 3669.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -140.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:01:54,753 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:01:54,758 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.96 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 194.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3669.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -140.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function j and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 174 SDtfs, 341 SDslu, 218 SDs, 0 SdLazy, 319 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital200 mio100 ax109 hnf100 lsp88 ukn84 mio100 lsp56 div100 bol100 ite100 ukn100 eq186 hnf83 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...