./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c42e17875debafbb946353bbf5dda6a0b0ba9b37 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:53:05,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:53:05,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:53:05,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:53:05,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:53:05,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:53:05,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:53:05,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:53:05,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:53:05,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:53:05,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:53:05,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:53:05,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:53:05,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:53:05,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:53:05,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:53:05,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:53:05,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:53:05,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:53:05,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:53:05,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:53:05,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:53:05,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:53:05,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:53:05,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:53:05,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:53:05,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:53:05,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:53:05,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:53:05,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:53:05,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:53:05,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:53:05,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:53:05,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:53:05,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:53:05,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:53:05,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:53:05,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:53:05,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:53:05,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:53:05,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:53:05,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:53:05,911 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:53:05,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:53:05,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:53:05,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:53:05,917 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:53:05,917 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:53:05,917 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:53:05,917 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:53:05,918 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:53:05,918 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:53:05,919 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:53:05,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:53:05,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:53:05,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:53:05,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:53:05,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:53:05,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:53:05,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:53:05,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:53:05,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:53:05,924 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:53:05,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:53:05,924 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:53:05,925 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:53:05,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:53:05,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:53:05,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:53:05,926 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:53:05,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:53:05,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:53:05,927 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:53:05,929 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:53:05,930 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c42e17875debafbb946353bbf5dda6a0b0ba9b37 [2019-11-28 03:53:06,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:53:06,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:53:06,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:53:06,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:53:06,283 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:53:06,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2019-11-28 03:53:06,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33048572f/b72c224cefa54b40a02009dcf4a2e9e3/FLAGb7c478577 [2019-11-28 03:53:06,863 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:53:06,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2019-11-28 03:53:06,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33048572f/b72c224cefa54b40a02009dcf4a2e9e3/FLAGb7c478577 [2019-11-28 03:53:07,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33048572f/b72c224cefa54b40a02009dcf4a2e9e3 [2019-11-28 03:53:07,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:53:07,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:53:07,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:07,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:53:07,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:53:07,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07, skipping insertion in model container [2019-11-28 03:53:07,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:53:07,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:53:07,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:53:07,685 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:53:07,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:53:07,814 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:53:07,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07 WrapperNode [2019-11-28 03:53:07,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:07,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:53:07,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:53:07,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:53:07,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:53:07,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:53:07,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:53:07,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:53:07,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:53:07,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:53:07,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:53:07,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:53:07,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:53:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:53:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:53:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:53:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:53:07,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:53:08,289 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:53:08,289 INFO L297 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 03:53:08,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:08 BoogieIcfgContainer [2019-11-28 03:53:08,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:53:08,292 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:53:08,292 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:53:08,296 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:53:08,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:08,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:53:07" (1/3) ... [2019-11-28 03:53:08,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ddfca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:53:08, skipping insertion in model container [2019-11-28 03:53:08,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:08,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (2/3) ... [2019-11-28 03:53:08,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ddfca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:53:08, skipping insertion in model container [2019-11-28 03:53:08,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:08,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:08" (3/3) ... [2019-11-28 03:53:08,301 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-1.i [2019-11-28 03:53:08,349 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:53:08,349 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:53:08,349 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:53:08,349 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:53:08,350 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:53:08,350 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:53:08,350 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:53:08,350 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:53:08,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:53:08,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:53:08,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:08,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:08,392 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:53:08,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:08,392 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:53:08,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:53:08,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:53:08,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:08,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:08,395 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:53:08,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:08,401 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 6#L525true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L525-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 20#L530-3true [2019-11-28 03:53:08,402 INFO L796 eck$LassoCheckResult]: Loop: 20#L530-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 17#L530-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 20#L530-3true [2019-11-28 03:53:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 03:53:08,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855232136] [2019-11-28 03:53:08,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-28 03:53:08,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164160694] [2019-11-28 03:53:08,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-28 03:53:08,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125060788] [2019-11-28 03:53:08,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,814 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-28 03:53:08,873 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:08,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:08,874 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:08,875 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:08,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:08,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:08,876 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:08,876 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration1_Lasso [2019-11-28 03:53:08,876 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:08,876 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:08,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:09,333 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:09,810 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:53:09,810 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,824 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:53:09,824 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:09,825 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2019-11-28 03:53:09,847 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:53:09,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:53:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:09,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:53:09,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:09,941 WARN L253 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:53:09,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:09,990 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:53:09,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-28 03:53:10,111 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 8 states. [2019-11-28 03:53:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-11-28 03:53:10,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 03:53:10,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 03:53:10,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-28 03:53:10,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-11-28 03:53:10,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:10,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 15 states and 20 transitions. [2019-11-28 03:53:10,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:53:10,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:53:10,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-28 03:53:10,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:10,130 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:53:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-28 03:53:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 03:53:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:53:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-28 03:53:10,160 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:53:10,160 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:53:10,160 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:53:10,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-28 03:53:10,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:10,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:10,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:10,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,162 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 137#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 131#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 132#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 135#L530-3 assume !(main_~i~1 < main_~array_size~0); 126#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 127#L515-3 [2019-11-28 03:53:10,162 INFO L796 eck$LassoCheckResult]: Loop: 127#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 133#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 136#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 128#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 129#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 134#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 127#L515-3 [2019-11-28 03:53:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-28 03:53:10,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504466566] [2019-11-28 03:53:10,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:10,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504466566] [2019-11-28 03:53:10,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:10,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:53:10,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679472339] [2019-11-28 03:53:10,281 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 1 times [2019-11-28 03:53:10,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155113137] [2019-11-28 03:53:10,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,487 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-28 03:53:10,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:53:10,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:53:10,549 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:53:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:10,583 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-11-28 03:53:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:53:10,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-28 03:53:10,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:10,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-11-28 03:53:10,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:53:10,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:53:10,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-28 03:53:10,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:10,590 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 03:53:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-28 03:53:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 03:53:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:53:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:53:10,594 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:53:10,595 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:53:10,595 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:53:10,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 03:53:10,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:10,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:10,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:10,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,599 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,599 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 175#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 169#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 170#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 173#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 177#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 178#L530-3 assume !(main_~i~1 < main_~array_size~0); 164#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 165#L515-3 [2019-11-28 03:53:10,599 INFO L796 eck$LassoCheckResult]: Loop: 165#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 171#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 174#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 166#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 167#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 172#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 165#L515-3 [2019-11-28 03:53:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-28 03:53:10,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227771171] [2019-11-28 03:53:10,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 2 times [2019-11-28 03:53:10,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851438685] [2019-11-28 03:53:10,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash -259891877, now seen corresponding path program 1 times [2019-11-28 03:53:10,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206269343] [2019-11-28 03:53:10,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:10,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206269343] [2019-11-28 03:53:10,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262990261] [2019-11-28 03:53:10,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:53:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:53:10,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:11,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:53:11,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-28 03:53:11,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864272822] [2019-11-28 03:53:11,113 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-11-28 03:53:11,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 03:53:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 03:53:11,145 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-28 03:53:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:11,304 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-28 03:53:11,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:53:11,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-28 03:53:11,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:11,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-11-28 03:53:11,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:53:11,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:53:11,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 03:53:11,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:11,307 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 03:53:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 03:53:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 03:53:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:53:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 03:53:11,309 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:53:11,309 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:53:11,310 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:53:11,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 03:53:11,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:11,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:11,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:11,311 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:11,311 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:53:11,311 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 275#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 269#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 270#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 273#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 277#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 278#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 279#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 280#L530-3 assume !(main_~i~1 < main_~array_size~0); 264#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 265#L515-3 [2019-11-28 03:53:11,312 INFO L796 eck$LassoCheckResult]: Loop: 265#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 274#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 266#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 267#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 265#L515-3 [2019-11-28 03:53:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-28 03:53:11,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439950726] [2019-11-28 03:53:11,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 3 times [2019-11-28 03:53:11,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891084454] [2019-11-28 03:53:11,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1804388285, now seen corresponding path program 2 times [2019-11-28 03:53:11,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585274645] [2019-11-28 03:53:11,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,496 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-11-28 03:53:11,732 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-11-28 03:53:11,808 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:11,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:11,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:11,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:11,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:11,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:11,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:11,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:11,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration4_Lasso [2019-11-28 03:53:11,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:11,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:11,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:12,002 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-28 03:53:12,475 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:12,476 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:12,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:12,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:12,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:12,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:12,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:12,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:13,000 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-28 03:53:13,000 INFO L444 ModelExtractionUtils]: 21 out of 40 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:13,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:13,012 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:13,013 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:13,013 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:53:13,040 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:53:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:13,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:13,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:13,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:53:13,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:13,101 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:53:13,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 03:53:13,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 31 transitions. Complement of second has 4 states. [2019-11-28 03:53:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-28 03:53:13,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 03:53:13,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:13,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-28 03:53:13,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:13,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-28 03:53:13,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:13,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-28 03:53:13,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:13,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2019-11-28 03:53:13,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:53:13,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:53:13,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-28 03:53:13,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:13,121 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:53:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-28 03:53:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 03:53:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:53:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-28 03:53:13,123 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 03:53:13,124 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 03:53:13,124 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:53:13,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-28 03:53:13,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:13,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:13,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:13,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:53:13,126 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 414#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 405#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 406#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 411#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 416#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 417#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 418#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 419#L530-3 assume !(main_~i~1 < main_~array_size~0); 398#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 399#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 407#L518-6 [2019-11-28 03:53:13,126 INFO L796 eck$LassoCheckResult]: Loop: 407#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 412#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 400#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 401#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 407#L518-6 [2019-11-28 03:53:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-28 03:53:13,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796848916] [2019-11-28 03:53:13,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 1 times [2019-11-28 03:53:13,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452848446] [2019-11-28 03:53:13,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1166584787, now seen corresponding path program 1 times [2019-11-28 03:53:13,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531872939] [2019-11-28 03:53:13,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,573 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2019-11-28 03:53:13,660 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:13,660 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:13,660 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:13,660 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:13,661 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:13,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:13,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:13,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:13,661 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration5_Lasso [2019-11-28 03:53:13,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:13,662 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:13,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,854 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-28 03:53:13,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:13,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:14,243 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:14,243 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:14,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:14,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:14,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:14,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:14,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:14,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:14,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:14,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:14,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:14,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:14,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:14,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:14,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:14,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:14,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:14,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:14,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:14,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:14,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:14,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:14,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:14,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:14,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:14,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:14,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,375 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:14,434 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-11-28 03:53:14,434 INFO L444 ModelExtractionUtils]: 7 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:14,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,441 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:14,441 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:14,442 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-28 03:53:14,453 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:53:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:14,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:14,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:14,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:53:14,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:14,528 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:53:14,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:53:14,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 53 states and 68 transitions. Complement of second has 9 states. [2019-11-28 03:53:14,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:53:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-28 03:53:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 03:53:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 03:53:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:14,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-28 03:53:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:14,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. [2019-11-28 03:53:14,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:14,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 46 transitions. [2019-11-28 03:53:14,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:53:14,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:53:14,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-11-28 03:53:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:14,587 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-28 03:53:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-11-28 03:53:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-11-28 03:53:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:53:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-28 03:53:14,592 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-28 03:53:14,592 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-28 03:53:14,592 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:53:14,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-28 03:53:14,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:14,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:14,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:14,594 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:14,594 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:53:14,594 INFO L794 eck$LassoCheckResult]: Stem: 580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 579#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 568#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 569#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 575#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 581#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 582#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 584#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 585#L530-3 assume !(main_~i~1 < main_~array_size~0); 562#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 563#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 572#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 583#L518-1 assume !insertionSort_#t~short6; 566#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 567#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 573#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 574#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 570#L518-6 [2019-11-28 03:53:14,594 INFO L796 eck$LassoCheckResult]: Loop: 570#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 577#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 564#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 565#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 570#L518-6 [2019-11-28 03:53:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:14,594 INFO L82 PathProgramCache]: Analyzing trace with hash 103309060, now seen corresponding path program 1 times [2019-11-28 03:53:14,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:14,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123772918] [2019-11-28 03:53:14,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:53:14,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123772918] [2019-11-28 03:53:14,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:14,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:53:14,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349329637] [2019-11-28 03:53:14,649 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:14,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 2 times [2019-11-28 03:53:14,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:14,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5894090] [2019-11-28 03:53:14,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:14,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:14,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:53:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:53:14,779 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-28 03:53:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:14,855 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-28 03:53:14,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:53:14,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-28 03:53:14,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:14,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-11-28 03:53:14,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:53:14,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:53:14,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-11-28 03:53:14,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:14,859 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-28 03:53:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-11-28 03:53:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-11-28 03:53:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 03:53:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-11-28 03:53:14,862 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 03:53:14,862 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 03:53:14,862 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:53:14,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-11-28 03:53:14,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:14,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:14,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:14,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:14,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:53:14,865 INFO L794 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 660#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 647#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 648#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 654#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 662#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 663#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 664#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 665#L530-3 assume !(main_~i~1 < main_~array_size~0); 641#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 642#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 655#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 658#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 645#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 646#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 649#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 650#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 651#L518-6 [2019-11-28 03:53:14,865 INFO L796 eck$LassoCheckResult]: Loop: 651#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 657#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 643#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 644#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 651#L518-6 [2019-11-28 03:53:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash 101462018, now seen corresponding path program 3 times [2019-11-28 03:53:14,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:14,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484434855] [2019-11-28 03:53:14,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:14,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484434855] [2019-11-28 03:53:14,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235766784] [2019-11-28 03:53:14,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:53:14,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 03:53:14,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:53:14,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:53:14,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:15,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:53:15,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-28 03:53:15,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030800813] [2019-11-28 03:53:15,091 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 3 times [2019-11-28 03:53:15,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:15,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868326360] [2019-11-28 03:53:15,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:15,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 03:53:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 03:53:15,188 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 14 states. [2019-11-28 03:53:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:15,380 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-11-28 03:53:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:53:15,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2019-11-28 03:53:15,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:15,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 34 states and 43 transitions. [2019-11-28 03:53:15,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:53:15,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:53:15,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2019-11-28 03:53:15,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:15,385 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-28 03:53:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2019-11-28 03:53:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-28 03:53:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 03:53:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 03:53:15,387 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 03:53:15,388 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 03:53:15,388 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:53:15,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2019-11-28 03:53:15,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:15,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:15,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:15,389 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:15,389 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:53:15,390 INFO L794 eck$LassoCheckResult]: Stem: 810#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 809#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 797#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 798#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 804#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 815#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 823#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 811#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 812#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 816#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 817#L530-3 assume !(main_~i~1 < main_~array_size~0); 791#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 792#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 807#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 813#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 814#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 808#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 802#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 803#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 799#L518-6 [2019-11-28 03:53:15,390 INFO L796 eck$LassoCheckResult]: Loop: 799#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 805#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 793#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 794#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 799#L518-6 [2019-11-28 03:53:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1730024032, now seen corresponding path program 4 times [2019-11-28 03:53:15,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:15,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305579318] [2019-11-28 03:53:15,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 4 times [2019-11-28 03:53:15,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:15,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354329357] [2019-11-28 03:53:15,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1424072763, now seen corresponding path program 1 times [2019-11-28 03:53:15,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:15,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335009096] [2019-11-28 03:53:15,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:15,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:16,245 WARN L192 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 128 [2019-11-28 03:53:16,395 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 03:53:16,400 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:16,400 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:16,400 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:16,400 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:16,400 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:16,401 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,401 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:16,401 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:16,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration8_Lasso [2019-11-28 03:53:16,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:16,401 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,510 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 03:53:16,514 INFO L168 Benchmark]: Toolchain (without parser) took 9349.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -353.5 MB). Peak memory consumption was 451.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:16,515 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:16,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:16,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:16,516 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:16,517 INFO L168 Benchmark]: RCFGBuilder took 380.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:16,518 INFO L168 Benchmark]: BuchiAutomizer took 8220.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -219.5 MB). Peak memory consumption was 445.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:16,521 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8220.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -219.5 MB). Peak memory consumption was 445.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...