./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 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/java_BubbleSort-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 862be090098a4271d6e1a31a6f1302665ccfc795 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-906a4fb [2020-10-19 20:25:33,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:25:33,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:25:33,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:25:33,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:25:33,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:25:33,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:25:33,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:25:33,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:25:33,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:25:33,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:25:33,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:25:33,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:25:33,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:25:33,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:25:33,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:25:33,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:25:33,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:25:33,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:25:33,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:25:33,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:25:33,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:25:33,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:25:33,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:25:33,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:25:33,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:25:33,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:25:33,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:25:33,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:25:33,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:25:33,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:25:33,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:25:33,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:25:33,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:25:33,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:25:33,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:25:33,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:25:33,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:25:33,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:25:33,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:25:33,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:25:33,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:25:33,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:25:33,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:25:33,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:25:33,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:25:33,362 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:25:33,362 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:25:33,363 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:25:33,363 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:25:33,363 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:25:33,363 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:25:33,364 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:25:33,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:25:33,364 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:25:33,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:25:33,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:25:33,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:25:33,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:25:33,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:25:33,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:25:33,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:25:33,366 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:25:33,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:25:33,366 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:25:33,366 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:25:33,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:25:33,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:25:33,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:25:33,367 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:25:33,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:25:33,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:25:33,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:25:33,368 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:25:33,369 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:25:33,369 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 -> 862be090098a4271d6e1a31a6f1302665ccfc795 [2020-10-19 20:25:33,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:25:33,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:25:33,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:25:33,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:25:33,694 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:25:33,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2020-10-19 20:25:33,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68b9b950/59f924815d99440987b58a81be0f16eb/FLAG328f7ae7e [2020-10-19 20:25:34,175 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:25:34,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2020-10-19 20:25:34,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68b9b950/59f924815d99440987b58a81be0f16eb/FLAG328f7ae7e [2020-10-19 20:25:34,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68b9b950/59f924815d99440987b58a81be0f16eb [2020-10-19 20:25:34,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:25:34,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:25:34,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:34,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:25:34,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:25:34,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:34" (1/1) ... [2020-10-19 20:25:34,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2382e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:34, skipping insertion in model container [2020-10-19 20:25:34,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:34" (1/1) ... [2020-10-19 20:25:34,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:25:34,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:25:34,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:34,871 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:25:35,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:35,079 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:25:35,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35 WrapperNode [2020-10-19 20:25:35,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:35,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:35,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:25:35,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:25:35,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:35,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:25:35,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:25:35,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:25:35,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (1/1) ... [2020-10-19 20:25:35,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:25:35,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:25:35,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:25:35,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:25:35,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (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 [2020-10-19 20:25:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:25:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:25:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:25:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:25:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:25:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:25:35,467 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:25:35,467 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-19 20:25:35,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:35 BoogieIcfgContainer [2020-10-19 20:25:35,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:25:35,470 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:25:35,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:25:35,474 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:25:35,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:35,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:25:34" (1/3) ... [2020-10-19 20:25:35,477 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c0e760b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:35, skipping insertion in model container [2020-10-19 20:25:35,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:35,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:35" (2/3) ... [2020-10-19 20:25:35,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c0e760b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:35, skipping insertion in model container [2020-10-19 20:25:35,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:35,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:35" (3/3) ... [2020-10-19 20:25:35,481 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2020-10-19 20:25:35,546 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:25:35,546 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:25:35,546 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:25:35,547 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:25:35,547 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:25:35,547 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:25:35,547 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:25:35,547 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:25:35,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-19 20:25:35,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:35,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:35,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:35,595 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:25:35,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:35,596 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:25:35,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-19 20:25:35,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:35,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:35,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:35,599 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:25:35,599 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:35,608 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 9#L523true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 14#L523-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 4#L528-3true [2020-10-19 20:25:35,608 INFO L796 eck$LassoCheckResult]: Loop: 4#L528-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 3#L528-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 4#L528-3true [2020-10-19 20:25:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-19 20:25:35,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:35,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801210077] [2020-10-19 20:25:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,766 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-19 20:25:35,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:35,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184412205] [2020-10-19 20:25:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,790 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-19 20:25:35,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:35,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063796604] [2020-10-19 20:25:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:36,084 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:36,085 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:36,085 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:36,086 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:36,086 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:36,086 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:36,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:36,087 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:36,087 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2020-10-19 20:25:36,087 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:36,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:36,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:36,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:36,557 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 [2020-10-19 20:25:36,570 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 [2020-10-19 20:25:36,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:36,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:36,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:36,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:36,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:36,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:36,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:36,580 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) [2020-10-19 20:25:36,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 [2020-10-19 20:25:36,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:36,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:36,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:36,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:36,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:36,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:36,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:36,636 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:36,682 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 [2020-10-19 20:25:36,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:36,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:36,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:36,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:36,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:36,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:36,703 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:36,728 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 [2020-10-19 20:25:36,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:36,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:36,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:36,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:36,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:36,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:36,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:36,734 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 [2020-10-19 20:25:36,758 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 [2020-10-19 20:25:36,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:36,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:36,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:36,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:36,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:36,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:36,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:36,769 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 [2020-10-19 20:25:36,792 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 [2020-10-19 20:25:36,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:36,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:36,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:36,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:36,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:36,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:36,826 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:36,871 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-19 20:25:36,871 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. 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 [2020-10-19 20:25:36,880 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:25:36,884 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:25:36,884 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:36,885 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -2*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2020-10-19 20:25:36,932 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 20:25:36,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:25:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:25:37,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,035 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:25:37,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:37,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 20:25:37,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2020-10-19 20:25:37,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 35 states and 53 transitions. Complement of second has 9 states. [2020-10-19 20:25:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:25:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-10-19 20:25:37,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 20:25:37,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:37,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-19 20:25:37,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:37,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-19 20:25:37,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:37,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2020-10-19 20:25:37,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:25:37,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2020-10-19 20:25:37,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:37,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 20:25:37,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-10-19 20:25:37,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:37,209 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 20:25:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-10-19 20:25:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-19 20:25:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 20:25:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-19 20:25:37,246 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 20:25:37,246 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 20:25:37,247 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:25:37,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-19 20:25:37,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:25:37,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:37,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:37,249 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,249 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:37,250 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 121#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 122#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 123#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 124#L528-3 assume !(main_~i~1 < main_~array_size~0); 128#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 131#L515-3 [2020-10-19 20:25:37,250 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 130#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 132#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 131#L515-3 [2020-10-19 20:25:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-19 20:25:37,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958817679] [2020-10-19 20:25:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:37,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958817679] [2020-10-19 20:25:37,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:25:37,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194540897] [2020-10-19 20:25:37,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-10-19 20:25:37,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430307518] [2020-10-19 20:25:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:37,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430307518] [2020-10-19 20:25:37,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:25:37,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033884982] [2020-10-19 20:25:37,384 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:25:37,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:25:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:25:37,392 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-19 20:25:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:37,426 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-10-19 20:25:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:25:37,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-10-19 20:25:37,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 20:25:37,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 20:25:37,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 20:25:37,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 20:25:37,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-19 20:25:37,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:37,431 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 20:25:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-19 20:25:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-19 20:25:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 20:25:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 20:25:37,436 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 20:25:37,436 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 20:25:37,436 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:25:37,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-19 20:25:37,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 20:25:37,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:37,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:37,442 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,442 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,442 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 157#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 158#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 159#L528-3 assume !(main_~i~1 < main_~array_size~0); 163#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 166#L515-3 [2020-10-19 20:25:37,443 INFO L796 eck$LassoCheckResult]: Loop: 166#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 168#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 164#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 165#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 169#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 166#L515-3 [2020-10-19 20:25:37,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2020-10-19 20:25:37,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960321513] [2020-10-19 20:25:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:37,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960321513] [2020-10-19 20:25:37,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:25:37,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035059764] [2020-10-19 20:25:37,503 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2020-10-19 20:25:37,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632277706] [2020-10-19 20:25:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,548 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:37,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:37,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:25:37,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:25:37,696 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-19 20:25:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:37,724 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-10-19 20:25:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:25:37,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-10-19 20:25:37,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 20:25:37,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-10-19 20:25:37,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 20:25:37,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 20:25:37,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-10-19 20:25:37,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:37,731 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 20:25:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-10-19 20:25:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-19 20:25:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 20:25:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-10-19 20:25:37,734 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-10-19 20:25:37,734 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-10-19 20:25:37,734 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:25:37,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-10-19 20:25:37,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 20:25:37,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:37,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:37,738 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,738 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,739 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 192#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 193#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 194#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 195#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 196#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 197#L528-3 assume !(main_~i~1 < main_~array_size~0); 199#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 202#L515-3 [2020-10-19 20:25:37,739 INFO L796 eck$LassoCheckResult]: Loop: 202#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 203#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 204#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 200#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 201#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 205#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 202#L515-3 [2020-10-19 20:25:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-10-19 20:25:37,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593122438] [2020-10-19 20:25:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,783 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2020-10-19 20:25:37,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388931360] [2020-10-19 20:25:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,801 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2020-10-19 20:25:37,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530188774] [2020-10-19 20:25:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:37,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530188774] [2020-10-19 20:25:37,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205173211] [2020-10-19 20:25:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:25:37,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:38,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:38,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-10-19 20:25:38,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337732074] [2020-10-19 20:25:38,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 20:25:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-19 20:25:38,155 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 11 states. [2020-10-19 20:25:38,374 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2020-10-19 20:25:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:38,407 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-10-19 20:25:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:25:38,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2020-10-19 20:25:38,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 20:25:38,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2020-10-19 20:25:38,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 20:25:38,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 20:25:38,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-10-19 20:25:38,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:38,410 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-19 20:25:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-10-19 20:25:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-19 20:25:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 20:25:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-19 20:25:38,412 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-19 20:25:38,412 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-19 20:25:38,412 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:25:38,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-10-19 20:25:38,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-19 20:25:38,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:38,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:38,414 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:38,414 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:38,414 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 290#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 291#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 292#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 293#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 294#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 295#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 297#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 305#L528-3 assume !(main_~i~1 < main_~array_size~0); 300#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 301#L515-3 [2020-10-19 20:25:38,414 INFO L796 eck$LassoCheckResult]: Loop: 301#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 302#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 303#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 298#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 299#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 304#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 301#L515-3 [2020-10-19 20:25:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-10-19 20:25:38,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403951014] [2020-10-19 20:25:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,437 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2020-10-19 20:25:38,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235437059] [2020-10-19 20:25:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,450 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2020-10-19 20:25:38,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788150830] [2020-10-19 20:25:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,488 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,815 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-10-19 20:25:38,904 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:38,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:38,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:38,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:38,904 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:38,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:38,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:38,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:38,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2020-10-19 20:25:38,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:38,905 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:38,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:38,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:39,488 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:39,488 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:25:39,492 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 [2020-10-19 20:25:39,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,497 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) [2020-10-19 20:25:39,550 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 [2020-10-19 20:25:39,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:39,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,558 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) [2020-10-19 20:25:39,603 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 [2020-10-19 20:25:39,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,612 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) [2020-10-19 20:25:39,649 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 [2020-10-19 20:25:39,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:39,659 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 [2020-10-19 20:25:39,693 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 [2020-10-19 20:25:39,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:39,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:39,702 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 [2020-10-19 20:25:39,741 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 [2020-10-19 20:25:39,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:39,750 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,783 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 [2020-10-19 20:25:39,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:39,787 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:39,819 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:39,824 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 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 [2020-10-19 20:25:39,858 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 [2020-10-19 20:25:39,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:39,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:39,865 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) [2020-10-19 20:25:39,911 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 [2020-10-19 20:25:39,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,914 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 [2020-10-19 20:25:39,916 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) [2020-10-19 20:25:39,965 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 [2020-10-19 20:25:39,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:39,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:39,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:39,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:39,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:39,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:39,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:39,970 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) [2020-10-19 20:25:40,020 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 [2020-10-19 20:25:40,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:40,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:40,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,025 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) [2020-10-19 20:25:40,067 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 [2020-10-19 20:25:40,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:40,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,076 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) [2020-10-19 20:25:40,110 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 [2020-10-19 20:25:40,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:40,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:40,113 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 [2020-10-19 20:25:40,115 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,145 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 [2020-10-19 20:25:40,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:40,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:40,159 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) [2020-10-19 20:25:40,193 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 [2020-10-19 20:25:40,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:40,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:40,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,203 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) [2020-10-19 20:25:40,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:40,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:40,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:40,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:40,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:40,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:40,247 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 [2020-10-19 20:25:40,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:40,294 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 20:25:40,294 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. 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) [2020-10-19 20:25:40,299 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,302 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:40,302 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:40,303 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2020-10-19 20:25:40,343 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 20:25:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:40,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:40,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:40,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:40,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:40,388 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 [2020-10-19 20:25:40,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-19 20:25:40,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 28 transitions. Complement of second has 4 states. [2020-10-19 20:25:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2020-10-19 20:25:40,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-19 20:25:40,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:40,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2020-10-19 20:25:40,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:40,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2020-10-19 20:25:40,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:40,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2020-10-19 20:25:40,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:40,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2020-10-19 20:25:40,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:40,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 20:25:40,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-10-19 20:25:40,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:40,406 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-10-19 20:25:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-10-19 20:25:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-19 20:25:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:25:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-19 20:25:40,408 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:25:40,408 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:25:40,408 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:25:40,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-19 20:25:40,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:40,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:40,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:40,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:40,410 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:40,410 INFO L794 eck$LassoCheckResult]: Stem: 418#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 412#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 413#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 414#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 415#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 419#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 420#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 416#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 417#L528-3 assume !(main_~i~1 < main_~array_size~0); 425#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 426#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 422#L516-3 [2020-10-19 20:25:40,410 INFO L796 eck$LassoCheckResult]: Loop: 422#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 427#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 421#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 422#L516-3 [2020-10-19 20:25:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-10-19 20:25:40,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:40,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726937075] [2020-10-19 20:25:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,432 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-10-19 20:25:40,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:40,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378885674] [2020-10-19 20:25:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,442 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2020-10-19 20:25:40,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:40,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232770940] [2020-10-19 20:25:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:40,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:40,467 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:40,767 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2020-10-19 20:25:40,848 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:40,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:40,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:40,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:40,848 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:40,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:40,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:40,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2020-10-19 20:25:40,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:40,849 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:40,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:40,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:40,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:40,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,000 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-10-19 20:25:41,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:41,282 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-10-19 20:25:41,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:41,513 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:25:41,532 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 [2020-10-19 20:25:41,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:41,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:41,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,536 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,562 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 [2020-10-19 20:25:41,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:41,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:41,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:41,565 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) [2020-10-19 20:25:41,587 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 [2020-10-19 20:25:41,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:41,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,593 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,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 [2020-10-19 20:25:41,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:41,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:41,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:41,623 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,645 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 [2020-10-19 20:25:41,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:41,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:41,653 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,675 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 [2020-10-19 20:25:41,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:41,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:41,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:41,761 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 20:25:41,762 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 14 variables to zero. 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) [2020-10-19 20:25:41,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:41,768 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:41,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_2) = -1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 Supporting invariants [] [2020-10-19 20:25:41,810 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-19 20:25:41,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:25:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:41,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:41,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:41,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:41,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:41,864 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 [2020-10-19 20:25:41,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-19 20:25:41,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 50 transitions. Complement of second has 7 states. [2020-10-19 20:25:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-19 20:25:41,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-10-19 20:25:41,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:41,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 20:25:41,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:41,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-10-19 20:25:41,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:41,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2020-10-19 20:25:41,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:41,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2020-10-19 20:25:41,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:41,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:41,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-10-19 20:25:41,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:41,888 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-19 20:25:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-10-19 20:25:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-10-19 20:25:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:25:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-10-19 20:25:41,891 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-19 20:25:41,891 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-19 20:25:41,891 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:25:41,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-10-19 20:25:41,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:41,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:41,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:41,893 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:41,893 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:41,894 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 559#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 560#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 561#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 562#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 563#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 565#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 577#L528-3 assume !(main_~i~1 < main_~array_size~0); 570#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 571#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 573#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 574#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 568#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 569#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 575#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 576#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 567#L516-3 [2020-10-19 20:25:41,894 INFO L796 eck$LassoCheckResult]: Loop: 567#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 572#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 566#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 567#L516-3 [2020-10-19 20:25:41,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-10-19 20:25:41,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:41,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162668536] [2020-10-19 20:25:41,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:41,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162668536] [2020-10-19 20:25:41,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354185310] [2020-10-19 20:25:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:41,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 20:25:41,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:42,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:42,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-19 20:25:42,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482516489] [2020-10-19 20:25:42,035 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-10-19 20:25:42,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426703046] [2020-10-19 20:25:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,045 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:42,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 20:25:42,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-19 20:25:42,119 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-10-19 20:25:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:42,206 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-10-19 20:25:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:25:42,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-10-19 20:25:42,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:42,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2020-10-19 20:25:42,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:42,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:42,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-10-19 20:25:42,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:42,209 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-19 20:25:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-10-19 20:25:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-19 20:25:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 20:25:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-19 20:25:42,211 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-19 20:25:42,211 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-19 20:25:42,211 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:25:42,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-19 20:25:42,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:42,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:42,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:42,213 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:42,213 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:42,214 INFO L794 eck$LassoCheckResult]: Stem: 683#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 677#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 678#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 679#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 680#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 681#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 682#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 698#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 684#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 685#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 697#L528-3 assume !(main_~i~1 < main_~array_size~0); 690#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 691#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 695#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 696#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 688#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 689#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 692#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 693#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 687#L516-3 [2020-10-19 20:25:42,214 INFO L796 eck$LassoCheckResult]: Loop: 687#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 694#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 686#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 687#L516-3 [2020-10-19 20:25:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-10-19 20:25:42,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281541090] [2020-10-19 20:25:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:42,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281541090] [2020-10-19 20:25:42,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302580153] [2020-10-19 20:25:42,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:42,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:25:42,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:25:42,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:25:42,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-19 20:25:42,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:42,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2020-10-19 20:25:42,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605357285] [2020-10-19 20:25:42,414 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-10-19 20:25:42,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121217284] [2020-10-19 20:25:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,425 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:42,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 20:25:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-10-19 20:25:42,503 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-10-19 20:25:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:42,770 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-10-19 20:25:42,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-19 20:25:42,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-10-19 20:25:42,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:42,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2020-10-19 20:25:42,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:25:42,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:25:42,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2020-10-19 20:25:42,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:42,775 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2020-10-19 20:25:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2020-10-19 20:25:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2020-10-19 20:25:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:25:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-10-19 20:25:42,777 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:25:42,777 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:25:42,777 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:25:42,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-10-19 20:25:42,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:42,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:42,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:42,779 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:42,779 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:42,779 INFO L794 eck$LassoCheckResult]: Stem: 840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 834#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 835#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 836#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 837#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 838#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 839#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 841#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 856#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 855#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 854#L528-3 assume !(main_~i~1 < main_~array_size~0); 846#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 847#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 852#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 858#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 844#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 845#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 849#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 853#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 857#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 850#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 851#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 843#L516-3 [2020-10-19 20:25:42,779 INFO L796 eck$LassoCheckResult]: Loop: 843#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 848#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 842#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 843#L516-3 [2020-10-19 20:25:42,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,779 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-10-19 20:25:42,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663487416] [2020-10-19 20:25:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,812 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-10-19 20:25:42,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629237215] [2020-10-19 20:25:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2020-10-19 20:25:42,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233925948] [2020-10-19 20:25:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:25:43,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233925948] [2020-10-19 20:25:43,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182389587] [2020-10-19 20:25:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:43,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-19 20:25:43,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:43,265 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-19 20:25:43,265 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-10-19 20:25:43,267 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:43,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:43,269 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:25:43,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-19 20:25:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-19 20:25:43,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:43,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-10-19 20:25:43,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919132419] [2020-10-19 20:25:43,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:43,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-19 20:25:43,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-19 20:25:43,349 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2020-10-19 20:25:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:43,601 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-10-19 20:25:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 20:25:43,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-10-19 20:25:43,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 20:25:43,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2020-10-19 20:25:43,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-19 20:25:43,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 20:25:43,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2020-10-19 20:25:43,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:43,605 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2020-10-19 20:25:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2020-10-19 20:25:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2020-10-19 20:25:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-19 20:25:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-10-19 20:25:43,609 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-10-19 20:25:43,609 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-10-19 20:25:43,609 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:25:43,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2020-10-19 20:25:43,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:43,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:43,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:43,611 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:43,611 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:43,611 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1012#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_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1013#L523 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1014#L523-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 1015#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1016#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1017#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1019#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1038#L528-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1037#L528-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1036#L528-3 assume !(main_~i~1 < main_~array_size~0); 1024#L528-4 sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 1025#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1031#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1042#L517 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 1022#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1023#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1028#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1034#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1041#L516-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 1029#L515-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 1030#L515-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 1021#L516-3 [2020-10-19 20:25:43,611 INFO L796 eck$LassoCheckResult]: Loop: 1021#L516-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1045#L517 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 1020#L516-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 1021#L516-3 [2020-10-19 20:25:43,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2020-10-19 20:25:43,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:43,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364600478] [2020-10-19 20:25:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:43,641 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-10-19 20:25:43,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:43,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436970474] [2020-10-19 20:25:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,648 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2020-10-19 20:25:43,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:43,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411012821] [2020-10-19 20:25:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:43,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:43,686 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:44,650 WARN L193 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 137 [2020-10-19 20:25:44,963 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-19 20:25:44,965 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:44,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:44,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:44,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:44,966 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:44,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,966 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:44,966 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:44,966 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2020-10-19 20:25:44,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:44,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:44,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:44,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:44,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:44,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:45,050 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:461) 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:382) 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:320) 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) [2020-10-19 20:25:45,058 INFO L168 Benchmark]: Toolchain (without parser) took 10558.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.2 MB). Free memory was 953.3 MB in the beginning and 1.3 GB in the end (delta: -317.5 MB). Peak memory consumption was 447.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:45,058 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:45,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:45,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.87 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. [2020-10-19 20:25:45,060 INFO L168 Benchmark]: Boogie Preprocessor took 28.22 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:45,061 INFO L168 Benchmark]: RCFGBuilder took 311.67 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:45,061 INFO L168 Benchmark]: BuchiAutomizer took 9586.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.0 MB). Peak memory consumption was 442.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:45,064 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 571.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.22 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.67 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9586.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.0 MB). Peak memory consumption was 442.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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...