./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0db1674e58e1126b93b48759a00b2e69f0d5f058 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:16:08,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:16:08,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:16:08,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:16:08,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:16:08,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:16:08,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:16:08,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:16:08,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:16:08,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:16:08,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:16:08,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:16:08,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:16:08,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:16:08,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:16:08,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:16:08,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:16:08,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:16:08,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:16:08,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:16:08,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:16:08,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:16:08,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:16:08,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:16:08,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:16:08,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:16:08,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:16:08,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:16:08,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:16:08,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:16:08,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:16:08,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:16:08,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:16:08,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:16:08,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:16:08,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:16:08,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:16:08,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:16:08,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:16:08,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:16:08,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:16:08,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:16:08,228 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:16:08,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:16:08,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:16:08,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:16:08,230 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:16:08,230 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:16:08,230 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:16:08,230 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:16:08,230 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:16:08,231 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:16:08,231 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:16:08,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:16:08,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:16:08,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:16:08,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:16:08,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:16:08,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:16:08,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:16:08,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:16:08,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:16:08,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:16:08,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:16:08,234 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:16:08,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:16:08,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:16:08,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:16:08,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:16:08,235 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:16:08,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:16:08,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:16:08,235 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:16:08,236 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:16:08,238 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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-11-28 03:16:08,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:16:08,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:16:08,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:16:08,561 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:16:08,561 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:16:08,562 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-28 03:16:08,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600274c10/f983b9905d254990a78cc4fc57c7119e/FLAGdd4768bf8 [2019-11-28 03:16:09,178 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:16:09,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-28 03:16:09,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600274c10/f983b9905d254990a78cc4fc57c7119e/FLAGdd4768bf8 [2019-11-28 03:16:09,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600274c10/f983b9905d254990a78cc4fc57c7119e [2019-11-28 03:16:09,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:16:09,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:16:09,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:09,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:16:09,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:16:09,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:09" (1/1) ... [2019-11-28 03:16:09,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecd73ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09, skipping insertion in model container [2019-11-28 03:16:09,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:09" (1/1) ... [2019-11-28 03:16:09,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:16:09,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:16:09,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:09,998 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:16:10,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:10,119 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:16:10,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10 WrapperNode [2019-11-28 03:16:10,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:10,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:10,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:16:10,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:16:10,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:10,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:16:10,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:16:10,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:16:10,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:16:10,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:16:10,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:16:10,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:16:10,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:16:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:16:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:16:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:16:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:16:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 03:16:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:16:10,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:16:10,690 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:16:10,690 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:16:10,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:10 BoogieIcfgContainer [2019-11-28 03:16:10,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:16:10,692 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:16:10,693 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:16:10,696 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:16:10,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:10,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:09" (1/3) ... [2019-11-28 03:16:10,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f16ca8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:10, skipping insertion in model container [2019-11-28 03:16:10,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:10,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10" (2/3) ... [2019-11-28 03:16:10,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f16ca8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:10, skipping insertion in model container [2019-11-28 03:16:10,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:10,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:10" (3/3) ... [2019-11-28 03:16:10,703 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2019-11-28 03:16:10,753 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:16:10,753 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:16:10,753 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:16:10,753 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:16:10,754 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:16:10,754 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:16:10,754 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:16:10,754 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:16:10,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:16:10,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:16:10,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:10,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:10,795 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:10,795 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:10,795 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:16:10,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:16:10,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:16:10,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:10,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:10,798 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:10,798 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:10,805 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 14#L532-3true [2019-11-28 03:16:10,805 INFO L796 eck$LassoCheckResult]: Loop: 14#L532-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 5#L523true assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 9#L523-2true call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L518true main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 11#L532-1true assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 14#L532-3true [2019-11-28 03:16:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:16:10,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:10,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140503353] [2019-11-28 03:16:10,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:10,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:10,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:10,980 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-11-28 03:16:10,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:10,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254488891] [2019-11-28 03:16:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:11,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-11-28 03:16:11,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:11,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405534589] [2019-11-28 03:16:11,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:11,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405534589] [2019-11-28 03:16:11,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:11,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:16:11,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732876696] [2019-11-28 03:16:12,207 WARN L192 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-11-28 03:16:13,073 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:16:13,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:13,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:16:13,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:16:13,089 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-11-28 03:16:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:13,178 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-28 03:16:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:16:13,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 03:16:13,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:16:13,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2019-11-28 03:16:13,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:16:13,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:16:13,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 03:16:13,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:13,191 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:16:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 03:16:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-28 03:16:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 03:16:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-28 03:16:13,221 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 03:16:13,221 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 03:16:13,222 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:16:13,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-28 03:16:13,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:16:13,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:13,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:13,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:16:13,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:13,224 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 48#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 49#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 60#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 50#L523-2 [2019-11-28 03:16:13,224 INFO L796 eck$LassoCheckResult]: Loop: 50#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 51#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 54#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 56#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 59#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 50#L523-2 [2019-11-28 03:16:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-11-28 03:16:13,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121824196] [2019-11-28 03:16:13,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-11-28 03:16:13,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934890034] [2019-11-28 03:16:13,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-11-28 03:16:13,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583864064] [2019-11-28 03:16:13,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:14,228 WARN L192 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-11-28 03:16:15,303 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 139 [2019-11-28 03:16:15,712 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2019-11-28 03:16:15,850 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-28 03:16:15,864 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:16:15,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:16:15,866 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:16:15,866 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:16:15,866 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:16:15,866 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:15,866 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:16:15,866 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:16:15,867 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2019-11-28 03:16:15,867 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:16:15,867 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:16:15,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:15,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:16,463 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-28 03:16:18,156 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-28 03:16:18,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:18,486 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 03:16:18,843 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-28 03:16:20,600 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-11-28 03:16:26,494 WARN L192 SmtUtils]: Spent 5.89 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-11-28 03:16:26,669 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:16:26,675 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) [2019-11-28 03:16:26,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:26,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:26,707 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) [2019-11-28 03:16:26,729 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:26,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:26,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,755 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 [2019-11-28 03:16:26,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:26,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:26,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:26,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:26,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:26,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,856 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 [2019-11-28 03:16:26,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:26,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,884 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) [2019-11-28 03:16:26,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:26,919 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 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:26,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,946 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 [2019-11-28 03:16:26,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:26,968 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 [2019-11-28 03:16:26,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:26,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:26,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:26,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:26,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:26,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:26,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:26,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:26,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:26,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:26,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:27,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:27,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:27,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:27,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:27,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:27,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:27,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:27,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:27,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:27,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:27,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:27,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:27,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:27,043 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:27,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:27,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:27,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:27,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:27,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:27,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:27,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:27,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:27,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:27,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:27,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:27,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:27,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:27,064 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:16:27,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:27,065 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:16:27,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:27,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:27,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 [2019-11-28 03:16:27,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:27,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:27,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:27,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:27,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:27,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:27,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:27,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:27,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:27,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:27,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:27,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:27,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:27,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:27,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:27,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:27,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:27,127 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-28 03:16:27,127 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2019-11-28 03:16:27,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:28,563 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2019-11-28 03:16:28,564 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-11-28 03:16:31,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:31,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:31,766 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:31,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:31,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:31,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:31,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:31,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:31,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:31,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:31,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-11-28 03:16:31,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:31,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:31,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:31,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:31,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:31,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:31,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:31,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:31,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:31,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:31,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:31,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:31,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:31,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:31,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:31,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:31,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:31,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:31,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:16:31,972 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:16:31,972 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. 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 [2019-11-28 03:16:32,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:16:32,061 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:16:32,061 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:16:32,062 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-11-28 03:16:32,146 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 03:16:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:32,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:32,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:32,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:16:32,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:32,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:16:32,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 03:16:32,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2019-11-28 03:16:32,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:16:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 03:16:32,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-28 03:16:32,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:32,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 03:16:32,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:32,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-28 03:16:32,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:32,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-11-28 03:16:32,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:32,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-11-28 03:16:32,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:16:32,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:16:32,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-28 03:16:32,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:32,379 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 03:16:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-28 03:16:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 03:16:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:16:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 03:16:32,384 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:16:32,384 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:16:32,384 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:16:32,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 03:16:32,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:32,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:32,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:32,387 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:32,387 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:32,388 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 163#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 164#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 177#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 179#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 166#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 172#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 173#L532-4 assume !(main_~length~0 > 0); 176#L545-1 [2019-11-28 03:16:32,388 INFO L796 eck$LassoCheckResult]: Loop: 176#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 176#L545-1 [2019-11-28 03:16:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2019-11-28 03:16:32,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:32,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643379947] [2019-11-28 03:16:32,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:32,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643379947] [2019-11-28 03:16:32,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:32,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:16:32,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353565370] [2019-11-28 03:16:32,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2019-11-28 03:16:32,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:32,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022714488] [2019-11-28 03:16:32,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:32,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:32,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:32,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:16:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:16:32,639 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 03:16:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:32,663 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-28 03:16:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:16:32,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 03:16:32,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:32,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2019-11-28 03:16:32,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:16:32,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:16:32,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2019-11-28 03:16:32,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:32,666 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 03:16:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2019-11-28 03:16:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 03:16:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:16:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 03:16:32,668 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 03:16:32,668 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 03:16:32,668 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:16:32,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-28 03:16:32,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:32,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:32,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:32,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:32,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:32,670 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 206#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 207#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 220#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 222#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 211#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 214#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 215#L532-4 assume main_~length~0 > 0; 208#L537 assume !(main_~length~0 < 0); 209#L537-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 219#L545-1 [2019-11-28 03:16:32,670 INFO L796 eck$LassoCheckResult]: Loop: 219#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 219#L545-1 [2019-11-28 03:16:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2019-11-28 03:16:32,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:32,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64553555] [2019-11-28 03:16:32,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:32,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2019-11-28 03:16:32,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:32,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024693093] [2019-11-28 03:16:32,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:32,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2019-11-28 03:16:32,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:32,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943979707] [2019-11-28 03:16:32,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:32,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943979707] [2019-11-28 03:16:32,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:32,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:16:32,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399039722] [2019-11-28 03:16:32,941 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-28 03:16:33,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:16:33,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:16:33,011 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 03:16:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:33,048 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-28 03:16:33,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:16:33,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2019-11-28 03:16:33,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:33,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2019-11-28 03:16:33,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:16:33,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:16:33,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2019-11-28 03:16:33,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:33,052 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-28 03:16:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2019-11-28 03:16:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-28 03:16:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:16:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 03:16:33,055 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:16:33,055 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:16:33,055 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:16:33,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 03:16:33,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:33,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:33,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:33,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:33,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:33,058 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 264#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 265#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 277#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 268#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 269#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 274#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 275#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 278#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 280#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 279#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 272#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 273#L532-4 assume main_~length~0 > 0; 266#L537 assume !(main_~length~0 < 0); 267#L537-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 276#L545-1 [2019-11-28 03:16:33,058 INFO L796 eck$LassoCheckResult]: Loop: 276#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 276#L545-1 [2019-11-28 03:16:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2019-11-28 03:16:33,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159043573] [2019-11-28 03:16:33,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159043573] [2019-11-28 03:16:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651951318] [2019-11-28 03:16:33,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:33,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 03:16:33,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:33,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:33,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2019-11-28 03:16:33,330 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:33,360 INFO L588 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-28 03:16:33,361 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:33,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-11-28 03:16:33,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-28 03:16:33,385 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:33,387 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:33,387 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:33,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-28 03:16:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:33,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:33,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-28 03:16:33,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664996819] [2019-11-28 03:16:33,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,390 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2019-11-28 03:16:33,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371332964] [2019-11-28 03:16:33,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:16:33,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:16:33,526 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-28 03:16:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:33,602 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-28 03:16:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:16:33,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-28 03:16:33,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:33,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 03:16:33,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:16:33,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:16:33,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-28 03:16:33,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:33,604 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 03:16:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-28 03:16:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:16:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:16:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 03:16:33,606 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 03:16:33,606 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 03:16:33,607 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:16:33,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-28 03:16:33,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 03:16:33,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:33,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:33,608 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:33,608 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:33,608 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 355#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 356#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 368#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 359#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 360#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 365#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 366#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 369#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 371#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 370#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 363#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 364#L532-4 assume main_~length~0 > 0; 357#L537 assume !(main_~length~0 < 0); 358#L537-2 call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 367#L545-1 [2019-11-28 03:16:33,608 INFO L796 eck$LassoCheckResult]: Loop: 367#L545-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 367#L545-1 [2019-11-28 03:16:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2019-11-28 03:16:33,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525585308] [2019-11-28 03:16:33,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2019-11-28 03:16:33,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230074292] [2019-11-28 03:16:33,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2019-11-28 03:16:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:33,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239297345] [2019-11-28 03:16:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:33,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:39,063 WARN L192 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 316 DAG size of output: 243 [2019-11-28 03:16:39,671 WARN L192 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-11-28 03:16:39,674 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:16:39,674 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:16:39,674 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:16:39,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:16:39,675 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:16:39,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:39,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:16:39,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:16:39,675 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2019-11-28 03:16:39,675 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:16:39,675 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:16:39,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:39,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:40,093 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 03:16:40,097 INFO L168 Benchmark]: Toolchain (without parser) took 30615.18 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 539.5 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -379.3 MB). Peak memory consumption was 593.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:40,098 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:40,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:40,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:40,100 INFO L168 Benchmark]: Boogie Preprocessor took 29.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:40,100 INFO L168 Benchmark]: RCFGBuilder took 485.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:40,101 INFO L168 Benchmark]: BuchiAutomizer took 29403.07 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 400.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -246.7 MB). Peak memory consumption was 586.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:40,104 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 636.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 485.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29403.07 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 400.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -246.7 MB). Peak memory consumption was 586.2 MB. Max. memory is 11.5 GB. * 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...