./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/diff-alloca-2.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 4654dbed0e523ad65784c661074162c44d8abe4e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-9a8b2e8 [2020-10-20 08:18:10,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:18:10,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:18:10,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:18:10,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:18:10,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:18:10,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:18:10,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:18:10,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:18:10,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:18:10,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:18:10,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:18:10,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:18:10,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:18:10,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:18:10,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:18:10,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:18:10,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:18:10,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:18:10,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:18:10,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:18:10,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:18:10,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:18:10,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:18:10,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:18:10,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:18:10,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:18:10,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:18:10,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:18:10,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:18:10,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:18:10,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:18:10,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:18:10,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:18:10,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:18:10,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:18:10,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:18:10,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:18:10,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:18:10,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:18:10,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:18:10,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:18:10,719 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:18:10,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:18:10,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:18:10,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:18:10,721 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:18:10,721 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:18:10,721 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:18:10,722 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:18:10,722 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:18:10,722 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:18:10,722 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:18:10,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:18:10,722 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:18:10,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:18:10,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:18:10,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:18:10,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:18:10,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:18:10,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:18:10,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:18:10,724 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:18:10,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:18:10,724 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:18:10,724 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:18:10,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:18:10,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:18:10,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:18:10,725 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:18:10,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:18:10,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:18:10,726 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:18:10,726 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:18:10,727 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:18:10,727 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 -> 4654dbed0e523ad65784c661074162c44d8abe4e [2020-10-20 08:18:10,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:18:10,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:18:10,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:18:10,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:18:10,949 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:18:10,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2020-10-20 08:18:11,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f948162d/38b8b14b9056482288e998b0a21d2b09/FLAG0256b4ed6 [2020-10-20 08:18:11,547 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:18:11,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2020-10-20 08:18:11,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f948162d/38b8b14b9056482288e998b0a21d2b09/FLAG0256b4ed6 [2020-10-20 08:18:11,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f948162d/38b8b14b9056482288e998b0a21d2b09 [2020-10-20 08:18:11,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:18:11,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:18:11,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:18:11,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:18:11,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:18:11,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:18:11" (1/1) ... [2020-10-20 08:18:11,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0b952a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:11, skipping insertion in model container [2020-10-20 08:18:11,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:18:11" (1/1) ... [2020-10-20 08:18:11,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:18:11,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:18:12,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:18:12,332 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:18:12,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:18:12,439 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:18:12,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12 WrapperNode [2020-10-20 08:18:12,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:18:12,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:18:12,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:18:12,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:18:12,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:18:12,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:18:12,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:18:12,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:18:12,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (1/1) ... [2020-10-20 08:18:12,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:18:12,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:18:12,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:18:12,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:18:12,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (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-20 08:18:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:18:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:18:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:18:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:18:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:18:12,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:18:13,007 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:18:13,007 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 08:18:13,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:13 BoogieIcfgContainer [2020-10-20 08:18:13,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:18:13,010 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:18:13,010 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:18:13,014 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:18:13,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:13,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:18:11" (1/3) ... [2020-10-20 08:18:13,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c3877d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:18:13, skipping insertion in model container [2020-10-20 08:18:13,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:13,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:18:12" (2/3) ... [2020-10-20 08:18:13,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c3877d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:18:13, skipping insertion in model container [2020-10-20 08:18:13,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:18:13,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:18:13" (3/3) ... [2020-10-20 08:18:13,022 INFO L373 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2020-10-20 08:18:13,071 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:18:13,071 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:18:13,071 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:18:13,071 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:18:13,072 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:18:13,072 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:18:13,073 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:18:13,073 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:18:13,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-10-20 08:18:13,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-20 08:18:13,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:13,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:13,118 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:18:13,118 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:13,118 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:18:13,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-10-20 08:18:13,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-20 08:18:13,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:13,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:13,121 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:18:13,121 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:13,128 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 18#L539true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 3#L539-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 14#L542-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 5#L549-3true [2020-10-20 08:18:13,128 INFO L796 eck$LassoCheckResult]: Loop: 5#L549-3true assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 4#L549-2true main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 5#L549-3true [2020-10-20 08:18:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-20 08:18:13,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:13,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14493876] [2020-10-20 08:18:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:13,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:13,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:13,298 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:13,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-20 08:18:13,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:13,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965457534] [2020-10-20 08:18:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:13,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:13,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:13,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-20 08:18:13,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:13,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915364050] [2020-10-20 08:18:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:13,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:13,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:13,381 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:13,755 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-10-20 08:18:13,894 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-20 08:18:13,910 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:13,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:13,911 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:13,918 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:13,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:13,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:13,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:13,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:13,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2020-10-20 08:18:13,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:13,921 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:13,959 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-20 08:18:13,973 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-20 08:18:13,978 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-20 08:18:13,983 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-20 08:18:14,244 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-10-20 08:18:14,268 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-20 08:18:14,272 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-20 08:18:14,275 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-20 08:18:14,282 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-20 08:18:14,285 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-20 08:18:14,289 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-20 08:18:14,295 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-20 08:18:14,298 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-20 08:18:14,301 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-20 08:18:14,305 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-20 08:18:14,308 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-20 08:18:14,676 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:14,681 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) [2020-10-20 08:18:14,687 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-20 08:18:14,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:14,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:14,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:14,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:14,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:14,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:14,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:14,698 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-20 08:18:14,763 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-20 08:18:14,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:14,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:14,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:14,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:14,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:14,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:14,767 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-20 08:18:14,770 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) [2020-10-20 08:18:14,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:14,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:14,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:14,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:14,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:14,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:14,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:14,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:14,819 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) [2020-10-20 08:18:14,857 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-20 08:18:14,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:14,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:14,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:14,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:14,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:14,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:14,874 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) [2020-10-20 08:18:14,916 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-20 08:18:14,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:14,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:14,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:14,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:14,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:14,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:14,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:15,010 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-10-20 08:18:15,010 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:15,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:15,021 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 08:18:15,021 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:15,023 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 2*ULTIMATE.start_main_~i~1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 2*ULTIMATE.start_main_~Alen~0 >= 0] [2020-10-20 08:18:15,114 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 08:18:15,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:18:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:15,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:18:15,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:15,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:18:15,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:15,311 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-20 08:18:15,332 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-20 08:18:15,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2020-10-20 08:18:15,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 45 states and 72 transitions. Complement of second has 9 states. [2020-10-20 08:18:15,478 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-20 08:18:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 08:18:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-10-20 08:18:15,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-20 08:18:15,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:15,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-20 08:18:15,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:15,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 08:18:15,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:15,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 72 transitions. [2020-10-20 08:18:15,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:15,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 17 states and 25 transitions. [2020-10-20 08:18:15,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:18:15,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:18:15,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-10-20 08:18:15,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:15,508 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:18:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-10-20 08:18:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-20 08:18:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:18:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-10-20 08:18:15,543 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:18:15,543 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:18:15,543 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:18:15,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-10-20 08:18:15,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:15,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:15,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:15,549 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:15,549 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:15,549 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 175#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 176#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 166#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 167#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 170#L549-3 assume !(main_~i~1 < main_~Alen~0); 171#L549-4 main_~i~2 := 0; 172#L554-3 [2020-10-20 08:18:15,550 INFO L796 eck$LassoCheckResult]: Loop: 172#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 179#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 172#L554-3 [2020-10-20 08:18:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-20 08:18:15,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228258935] [2020-10-20 08:18:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:15,653 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-20 08:18:15,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228258935] [2020-10-20 08:18:15,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:15,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:15,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723724111] [2020-10-20 08:18:15,660 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-20 08:18:15,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376416391] [2020-10-20 08:18:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:15,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:15,728 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-20 08:18:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:15,776 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-10-20 08:18:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:15,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-10-20 08:18:15,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:15,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-10-20 08:18:15,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:18:15,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:18:15,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-10-20 08:18:15,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:15,780 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 08:18:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-10-20 08:18:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-20 08:18:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:18:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-10-20 08:18:15,783 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-10-20 08:18:15,783 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-10-20 08:18:15,783 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:18:15,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-10-20 08:18:15,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:18:15,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:15,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:15,785 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:15,785 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:15,785 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 217#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 218#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 208#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 209#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 212#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 210#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 211#L549-3 assume !(main_~i~1 < main_~Alen~0); 213#L549-4 main_~i~2 := 0; 214#L554-3 [2020-10-20 08:18:15,786 INFO L796 eck$LassoCheckResult]: Loop: 214#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 221#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 214#L554-3 [2020-10-20 08:18:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2020-10-20 08:18:15,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655178950] [2020-10-20 08:18:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2020-10-20 08:18:15,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266936898] [2020-10-20 08:18:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,832 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2020-10-20 08:18:15,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:15,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722201417] [2020-10-20 08:18:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:15,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:15,893 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:16,254 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2020-10-20 08:18:16,406 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-10-20 08:18:16,408 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:16,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:16,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:16,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:16,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:16,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:16,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:16,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:16,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2020-10-20 08:18:16,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:16,409 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:16,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,417 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-20 08:18:16,420 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-20 08:18:16,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,426 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-20 08:18:16,429 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-20 08:18:16,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:18:16,435 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-20 08:18:16,438 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-20 08:18:16,689 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2020-10-20 08:18:16,718 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-20 08:18:16,721 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-20 08:18:16,724 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-20 08:18:16,730 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-20 08:18:16,732 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-20 08:18:16,917 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-20 08:18:17,183 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:17,183 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 08:18:17,199 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-20 08:18:17,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:17,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:17,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,253 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-20 08:18:17,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:17,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:17,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:17,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,297 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-20 08:18:17,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:17,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:17,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:17,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,329 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-20 08:18:17,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:17,339 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,378 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-20 08:18:17,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:17,387 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,414 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-20 08:18:17,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:17,423 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-20 08:18:17,455 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-20 08:18:17,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:17,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 08:18:17,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:17,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:17,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:17,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:17,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:17,556 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-20 08:18:17,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,566 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-20 08:18:17,611 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-20 08:18:17,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:17,661 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:17,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:17,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:17,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:17,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:17,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:17,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:17,733 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 08:18:17,733 INFO L444 ModelExtractionUtils]: 19 out of 40 variables were initially zero. Simplification set additionally 18 variables to zero. 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-20 08:18:17,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:17,751 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:18:17,752 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:17,752 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, ULTIMATE.start_main_~Blen~0) = -1*ULTIMATE.start_main_~i~2 + 1*ULTIMATE.start_main_~Blen~0 Supporting invariants [] [2020-10-20 08:18:17,826 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2020-10-20 08:18:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:17,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:17,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:17,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:17,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:17,873 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-20 08:18:17,873 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-20 08:18:17,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:18:17,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2020-10-20 08:18:17,893 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-20 08:18:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-10-20 08:18:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-20 08:18:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-20 08:18:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-20 08:18:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:17,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2020-10-20 08:18:17,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:17,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2020-10-20 08:18:17,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:18:17,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:17,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-10-20 08:18:17,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:17,897 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-20 08:18:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-10-20 08:18:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 08:18:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 08:18:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-10-20 08:18:17,900 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-20 08:18:17,900 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-20 08:18:17,900 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:18:17,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-10-20 08:18:17,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:17,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:17,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:17,901 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:17,901 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:17,902 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 371#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 372#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 362#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 363#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 366#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 364#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 365#L549-3 assume !(main_~i~1 < main_~Alen~0); 367#L549-4 main_~i~2 := 0; 368#L554-3 assume !(main_~i~2 < main_~Blen~0); 378#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 379#L519-2 [2020-10-20 08:18:17,902 INFO L796 eck$LassoCheckResult]: Loop: 379#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 370#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 373#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 375#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 379#L519-2 [2020-10-20 08:18:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-20 08:18:17,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807147077] [2020-10-20 08:18:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:17,934 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-20 08:18:17,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807147077] [2020-10-20 08:18:17,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:17,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:17,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349975592] [2020-10-20 08:18:17,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2020-10-20 08:18:17,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:17,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665655576] [2020-10-20 08:18:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:17,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:17,950 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:18,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:18,062 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-10-20 08:18:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:18,140 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-10-20 08:18:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:18:18,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-20 08:18:18,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:18,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2020-10-20 08:18:18,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:18:18,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:18:18,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-10-20 08:18:18,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:18,142 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 08:18:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-10-20 08:18:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-20 08:18:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 08:18:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-10-20 08:18:18,145 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 08:18:18,145 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 08:18:18,145 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:18:18,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-10-20 08:18:18,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:18:18,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:18,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:18,147 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:18,147 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 08:18:18,147 INFO L794 eck$LassoCheckResult]: Stem: 418#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 415#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 416#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 406#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 407#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 410#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 408#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 409#L549-3 assume !(main_~i~1 < main_~Alen~0); 411#L549-4 main_~i~2 := 0; 412#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 419#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 420#L554-3 assume !(main_~i~2 < main_~Blen~0); 422#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 423#L519-2 [2020-10-20 08:18:18,147 INFO L796 eck$LassoCheckResult]: Loop: 423#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 414#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 417#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 421#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 423#L519-2 [2020-10-20 08:18:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-20 08:18:18,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824016216] [2020-10-20 08:18:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2020-10-20 08:18:18,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728559586] [2020-10-20 08:18:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,199 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2020-10-20 08:18:18,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495007612] [2020-10-20 08:18:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:18:18,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495007612] [2020-10-20 08:18:18,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:18,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:18:18,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550864380] [2020-10-20 08:18:18,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:18,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:18:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:18:18,372 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 08:18:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:18,428 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-10-20 08:18:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:18:18,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2020-10-20 08:18:18,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:18:18,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2020-10-20 08:18:18,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:18:18,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 08:18:18,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-10-20 08:18:18,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:18,435 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-20 08:18:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-10-20 08:18:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-20 08:18:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 08:18:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-10-20 08:18:18,438 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 08:18:18,439 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 08:18:18,439 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:18:18,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-10-20 08:18:18,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 08:18:18,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:18,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:18,444 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:18,444 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:18:18,444 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 468#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 458#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 459#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 462#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 460#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 461#L549-3 assume !(main_~i~1 < main_~Alen~0); 463#L549-4 main_~i~2 := 0; 464#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 473#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 474#L554-3 assume !(main_~i~2 < main_~Blen~0); 475#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 476#L519-2 [2020-10-20 08:18:18,444 INFO L796 eck$LassoCheckResult]: Loop: 476#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 469#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 465#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 466#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 471#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 472#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 476#L519-2 [2020-10-20 08:18:18,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2020-10-20 08:18:18,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748243326] [2020-10-20 08:18:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,514 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2020-10-20 08:18:18,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305686848] [2020-10-20 08:18:18,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:18:18,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305686848] [2020-10-20 08:18:18,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:18,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:18:18,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618855471] [2020-10-20 08:18:18,551 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:18:18,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:18:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:18:18,552 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-10-20 08:18:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:18,606 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-10-20 08:18:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:18:18,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2020-10-20 08:18:18,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 08:18:18,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2020-10-20 08:18:18,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 08:18:18,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 08:18:18,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2020-10-20 08:18:18,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:18,609 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-20 08:18:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2020-10-20 08:18:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2020-10-20 08:18:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 08:18:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-10-20 08:18:18,613 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-20 08:18:18,613 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-20 08:18:18,613 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:18:18,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-10-20 08:18:18,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 08:18:18,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:18,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:18,616 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:18,616 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:18:18,617 INFO L794 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 521#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 522#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 511#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 512#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 515#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 513#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 514#L549-3 assume !(main_~i~1 < main_~Alen~0); 516#L549-4 main_~i~2 := 0; 517#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 525#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 526#L554-3 assume !(main_~i~2 < main_~Blen~0); 528#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 529#L519-2 [2020-10-20 08:18:18,617 INFO L796 eck$LassoCheckResult]: Loop: 529#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 530#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 518#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 519#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 523#L522-2 assume !(0 == diff_~found~0); 527#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 529#L519-2 [2020-10-20 08:18:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2020-10-20 08:18:18,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56175557] [2020-10-20 08:18:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,677 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2020-10-20 08:18:18,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290275957] [2020-10-20 08:18:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,697 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2020-10-20 08:18:18,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:18,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187143749] [2020-10-20 08:18:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:18,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:18,753 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:19,513 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 140 [2020-10-20 08:18:19,787 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-20 08:18:19,790 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:19,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:19,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:19,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:19,791 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:19,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:19,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:19,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:19,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2020-10-20 08:18:19,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:19,792 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:19,796 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-20 08:18:19,804 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-20 08:18:19,807 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-20 08:18:19,810 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-20 08:18:19,813 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-20 08:18:19,815 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-20 08:18:19,816 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-20 08:18:19,825 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-20 08:18:19,833 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-20 08:18:19,835 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-20 08:18:19,837 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-20 08:18:19,839 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-20 08:18:19,841 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-20 08:18:19,849 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-20 08:18:19,851 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-20 08:18:19,855 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-20 08:18:19,857 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-20 08:18:19,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-20 08:18:20,448 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2020-10-20 08:18:20,583 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-10-20 08:18:20,584 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-20 08:18:20,587 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-20 08:18:20,589 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-20 08:18:20,597 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-20 08:18:21,112 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2020-10-20 08:18:21,521 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-20 08:18:21,585 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:21,585 INFO L489 LassoAnalysis]: Using template 'affine'. 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-20 08:18:21,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:21,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:21,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:21,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,667 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-20 08:18:21,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,671 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-20 08:18:21,696 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:21,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:21,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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:21,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:18:21,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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-20 08:18:21,768 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-20 08:18:21,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,772 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-20 08:18:21,778 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,816 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-20 08:18:21,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:21,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:21,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,845 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-20 08:18:21,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:21,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:21,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,888 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-20 08:18:21,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,897 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) [2020-10-20 08:18:21,927 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,934 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-20 08:18:21,957 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:21,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,962 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-20 08:18:21,991 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-20 08:18:21,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:21,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:21,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:21,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:21,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:21,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:21,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:21,996 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-20 08:18:22,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-20 08:18:22,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:22,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:22,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:22,023 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-20 08:18:22,045 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-20 08:18:22,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:22,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:22,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:22,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,084 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-20 08:18:22,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:22,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:22,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:22,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,115 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-20 08:18:22,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:22,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:22,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:22,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,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-20 08:18:22,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,175 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-20 08:18:22,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,206 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,236 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-20 08:18:22,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,242 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,263 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-20 08:18:22,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:22,303 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-20 08:18:22,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,354 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-20 08:18:22,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:22,386 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-20 08:18:22,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,415 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-20 08:18:22,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:22,447 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:22,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:22,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:22,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:22,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:22,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:22,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:22,609 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2020-10-20 08:18:22,609 INFO L444 ModelExtractionUtils]: 50 out of 82 variables were initially zero. Simplification set additionally 29 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:22,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:18:22,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:18:22,617 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:22,617 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2020-10-20 08:18:22,738 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-10-20 08:18:22,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:22,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:22,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:22,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:22,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:22,836 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-20 08:18:22,836 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-20 08:18:22,836 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:18:22,862 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 4 states. [2020-10-20 08:18:22,862 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-20 08:18:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-10-20 08:18:22,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 6 letters. [2020-10-20 08:18:22,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:22,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2020-10-20 08:18:22,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:22,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 12 letters. [2020-10-20 08:18:22,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:22,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2020-10-20 08:18:22,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:22,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2020-10-20 08:18:22,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 08:18:22,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 08:18:22,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-20 08:18:22,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:22,867 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 08:18:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-20 08:18:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-20 08:18:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 08:18:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-10-20 08:18:22,870 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 08:18:22,870 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 08:18:22,870 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:18:22,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-10-20 08:18:22,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:22,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:22,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:22,872 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:22,872 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:22,872 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 746#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 747#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 734#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 735#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 738#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 736#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 737#L549-3 assume !(main_~i~1 < main_~Alen~0); 739#L549-4 main_~i~2 := 0; 740#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 750#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 751#L554-3 assume !(main_~i~2 < main_~Blen~0); 754#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 755#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 742#L523-2 [2020-10-20 08:18:22,872 INFO L796 eck$LassoCheckResult]: Loop: 742#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 741#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 742#L523-2 [2020-10-20 08:18:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217434, now seen corresponding path program 1 times [2020-10-20 08:18:22,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:22,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654059553] [2020-10-20 08:18:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:22,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:22,894 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:22,898 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2020-10-20 08:18:22,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:22,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807221614] [2020-10-20 08:18:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:22,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:22,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:22,908 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash -718428993, now seen corresponding path program 1 times [2020-10-20 08:18:22,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:22,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160451281] [2020-10-20 08:18:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:22,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:22,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:22,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:23,680 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 148 [2020-10-20 08:18:23,968 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-20 08:18:23,970 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:23,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:23,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:23,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:23,971 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:23,971 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:23,971 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:23,971 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:23,971 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2020-10-20 08:18:23,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:23,971 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:23,975 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-20 08:18:23,982 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-20 08:18:23,985 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-20 08:18:23,988 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-20 08:18:23,990 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-20 08:18:23,993 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-20 08:18:23,997 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-20 08:18:23,999 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-20 08:18:24,002 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-20 08:18:24,006 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-20 08:18:24,015 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-20 08:18:24,018 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-20 08:18:24,019 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-20 08:18:24,025 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-20 08:18:24,027 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-20 08:18:24,031 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-20 08:18:24,658 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2020-10-20 08:18:24,788 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2020-10-20 08:18:24,790 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-20 08:18:24,794 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-20 08:18:24,805 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-20 08:18:24,807 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-20 08:18:24,809 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-20 08:18:24,811 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-20 08:18:24,814 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-20 08:18:25,400 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2020-10-20 08:18:25,821 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:18:25,959 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:18:25,959 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:25,963 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-20 08:18:25,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:25,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:25,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:25,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:25,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:25,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:25,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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:25,991 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-20 08:18:25,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:25,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:25,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:25,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:25,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:25,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:25,997 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,021 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-20 08:18:26,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,047 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-20 08:18:26,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,050 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,074 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-20 08:18:26,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,079 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,102 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-20 08:18:26,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,107 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,131 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-20 08:18:26,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,133 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,156 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-20 08:18:26,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,185 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-20 08:18:26,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,190 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,217 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-20 08:18:26,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,227 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,253 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-20 08:18:26,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,256 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,279 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-20 08:18:26,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,283 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,309 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-20 08:18:26,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,312 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,336 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-20 08:18:26,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:18:26,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:18:26,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:18:26,339 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:26,361 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,366 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,390 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-20 08:18:26,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:18:26,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,420 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:26,454 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-20 08:18:26,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:18:26,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:18:26,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:18:26,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:18:26,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:18:26,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:18:26,564 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2020-10-20 08:18:26,564 INFO L444 ModelExtractionUtils]: 56 out of 82 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:18:26,576 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:26,579 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 08:18:26,579 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:18:26,579 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_main_~B~0.base)_2) = -4*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~B~0.base)_2 Supporting invariants [1*ULTIMATE.start_diff_~B.offset >= 0] [2020-10-20 08:18:26,734 INFO L297 tatePredicateManager]: 28 out of 30 supporting invariants were superfluous and have been removed [2020-10-20 08:18:26,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:18:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:18:26,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:26,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:18:26,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:26,851 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-20 08:18:26,853 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 08:18:26,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-10-20 08:18:26,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 46 states and 63 transitions. Complement of second has 9 states. [2020-10-20 08:18:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:18:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:18:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-10-20 08:18:26,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2020-10-20 08:18:26,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:26,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 16 letters. Loop has 2 letters. [2020-10-20 08:18:26,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:26,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-20 08:18:26,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:26,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2020-10-20 08:18:26,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:26,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 49 transitions. [2020-10-20 08:18:26,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 08:18:26,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 08:18:26,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2020-10-20 08:18:26,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:26,969 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2020-10-20 08:18:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2020-10-20 08:18:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-10-20 08:18:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 08:18:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-10-20 08:18:26,972 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 08:18:26,972 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 08:18:26,972 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:18:26,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-10-20 08:18:26,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:26,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:26,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:26,974 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:26,974 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:26,974 INFO L794 eck$LassoCheckResult]: Stem: 1022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1018#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1019#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1007#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1008#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1011#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1009#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1010#L549-3 assume !(main_~i~1 < main_~Alen~0); 1012#L549-4 main_~i~2 := 0; 1013#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1024#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1025#L554-3 assume !(main_~i~2 < main_~Blen~0); 1026#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1027#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1029#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1016#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1017#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1032#L522-2 assume !(0 == diff_~found~0); 1023#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1028#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1015#L523-2 [2020-10-20 08:18:26,974 INFO L796 eck$LassoCheckResult]: Loop: 1015#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1014#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1015#L523-2 [2020-10-20 08:18:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2007293386, now seen corresponding path program 1 times [2020-10-20 08:18:26,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:26,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376071645] [2020-10-20 08:18:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 08:18:26,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376071645] [2020-10-20 08:18:26,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:18:26,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:18:27,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417765257] [2020-10-20 08:18:27,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2020-10-20 08:18:27,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:27,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398283529] [2020-10-20 08:18:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,012 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:27,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:18:27,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:18:27,057 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-10-20 08:18:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:27,078 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-10-20 08:18:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:18:27,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2020-10-20 08:18:27,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:27,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2020-10-20 08:18:27,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 08:18:27,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 08:18:27,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2020-10-20 08:18:27,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:27,080 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-10-20 08:18:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2020-10-20 08:18:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-10-20 08:18:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 08:18:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-10-20 08:18:27,083 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-10-20 08:18:27,084 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-10-20 08:18:27,084 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:18:27,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2020-10-20 08:18:27,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:27,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:27,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:27,086 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:27,086 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:27,086 INFO L794 eck$LassoCheckResult]: Stem: 1086#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1082#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1083#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1071#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1072#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1075#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1073#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1074#L549-3 assume !(main_~i~1 < main_~Alen~0); 1076#L549-4 main_~i~2 := 0; 1077#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1087#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1088#L554-3 assume !(main_~i~2 < main_~Blen~0); 1091#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1092#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1094#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1080#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1081#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1096#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1090#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1093#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1079#L523-2 [2020-10-20 08:18:27,086 INFO L796 eck$LassoCheckResult]: Loop: 1079#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1078#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1079#L523-2 [2020-10-20 08:18:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2007295308, now seen corresponding path program 1 times [2020-10-20 08:18:27,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:27,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144009303] [2020-10-20 08:18:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:18:27,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144009303] [2020-10-20 08:18:27,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046460831] [2020-10-20 08:18:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:18:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:27,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 08:18:27,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:18:27,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:18:27,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-20 08:18:27,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254138965] [2020-10-20 08:18:27,242 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:18:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2020-10-20 08:18:27,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:27,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286221472] [2020-10-20 08:18:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,250 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:27,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:18:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 08:18:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-20 08:18:27,299 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 10 states. [2020-10-20 08:18:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:18:27,413 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2020-10-20 08:18:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 08:18:27,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 68 transitions. [2020-10-20 08:18:27,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:27,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 31 states and 40 transitions. [2020-10-20 08:18:27,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 08:18:27,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 08:18:27,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-10-20 08:18:27,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:18:27,415 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-20 08:18:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-10-20 08:18:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-10-20 08:18:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 08:18:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-10-20 08:18:27,420 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-10-20 08:18:27,420 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-10-20 08:18:27,420 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:18:27,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-10-20 08:18:27,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:18:27,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:18:27,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:18:27,422 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:18:27,422 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:18:27,423 INFO L794 eck$LassoCheckResult]: Stem: 1247#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1243#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1244#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1231#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1232#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1235#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1233#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1234#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1236#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1256#L549-3 assume !(main_~i~1 < main_~Alen~0); 1237#L549-4 main_~i~2 := 0; 1238#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1250#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1251#L554-3 assume !(main_~i~2 < main_~Blen~0); 1252#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1253#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1255#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1241#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1242#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1257#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1249#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1254#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1240#L523-2 [2020-10-20 08:18:27,424 INFO L796 eck$LassoCheckResult]: Loop: 1240#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1239#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1240#L523-2 [2020-10-20 08:18:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:27,425 INFO L82 PathProgramCache]: Analyzing trace with hash 633938194, now seen corresponding path program 2 times [2020-10-20 08:18:27,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:27,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023902352] [2020-10-20 08:18:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,482 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2020-10-20 08:18:27,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:27,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166490536] [2020-10-20 08:18:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,492 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash -670749641, now seen corresponding path program 3 times [2020-10-20 08:18:27,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:18:27,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135909251] [2020-10-20 08:18:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:18:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:18:27,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:18:27,579 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:18:28,902 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 253 DAG size of output: 194 [2020-10-20 08:18:29,353 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2020-10-20 08:18:29,356 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:18:29,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:18:29,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:18:29,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:18:29,356 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:18:29,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:18:29,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:18:29,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:18:29,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2020-10-20 08:18:29,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:18:29,357 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:18:29,360 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-20 08:18:29,365 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-20 08:18:29,368 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-20 08:18:29,371 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-20 08:18:29,373 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-20 08:18:29,375 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-20 08:18:29,378 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-20 08:18:29,381 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-20 08:18:29,383 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-20 08:18:29,386 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-20 08:18:29,388 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-20 08:18:29,390 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-20 08:18:29,395 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-20 08:18:29,396 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-20 08:18:29,400 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-20 08:18:29,658 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-20 08:18:29,663 INFO L168 Benchmark]: Toolchain (without parser) took 17809.54 ms. Allocated memory was 37.7 MB in the beginning and 135.3 MB in the end (delta: 97.5 MB). Free memory was 19.3 MB in the beginning and 16.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 102.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,664 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 35.1 MB. Free memory was 12.8 MB in the beginning and 12.7 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.25 ms. Allocated memory was 37.7 MB in the beginning and 46.7 MB in the end (delta: 8.9 MB). Free memory was 18.6 MB in the beginning and 29.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.00 ms. Allocated memory is still 46.7 MB. Free memory was 29.6 MB in the beginning and 27.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,665 INFO L168 Benchmark]: Boogie Preprocessor took 32.01 ms. Allocated memory is still 46.7 MB. Free memory was 27.6 MB in the beginning and 25.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,666 INFO L168 Benchmark]: RCFGBuilder took 477.24 ms. Allocated memory is still 46.7 MB. Free memory was 25.7 MB in the beginning and 21.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,667 INFO L168 Benchmark]: BuchiAutomizer took 16651.38 ms. Allocated memory was 46.7 MB in the beginning and 135.3 MB in the end (delta: 88.6 MB). Free memory was 20.9 MB in the beginning and 16.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 94.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:29,670 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.35 ms. Allocated memory is still 35.1 MB. Free memory was 12.8 MB in the beginning and 12.7 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 589.25 ms. Allocated memory was 37.7 MB in the beginning and 46.7 MB in the end (delta: 8.9 MB). Free memory was 18.6 MB in the beginning and 29.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.00 ms. Allocated memory is still 46.7 MB. Free memory was 29.6 MB in the beginning and 27.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 32.01 ms. Allocated memory is still 46.7 MB. Free memory was 27.6 MB in the beginning and 25.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 477.24 ms. Allocated memory is still 46.7 MB. Free memory was 25.7 MB in the beginning and 21.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 16651.38 ms. Allocated memory was 46.7 MB in the beginning and 135.3 MB in the end (delta: 88.6 MB). Free memory was 20.9 MB in the beginning and 16.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 94.9 MB. Max. memory is 14.3 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...