./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 f470102c 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.25-f470102 [2019-11-28 20:48:36,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:48:36,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:48:36,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:48:36,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:48:36,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:48:36,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:48:36,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:48:36,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:48:36,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:48:36,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:48:36,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:48:36,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:48:36,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:48:36,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:48:36,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:48:36,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:48:36,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:48:36,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:48:36,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:48:36,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:48:36,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:48:36,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:48:36,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:48:36,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:48:36,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:48:36,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:48:36,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:48:36,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:48:36,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:48:36,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:48:36,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:48:36,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:48:36,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:48:36,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:48:36,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:48:36,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:48:36,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:48:36,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:48:37,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:48:37,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:48:37,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:48:37,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:48:37,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:48:37,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:48:37,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:48:37,020 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:48:37,020 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:48:37,021 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:48:37,021 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:48:37,021 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:48:37,021 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:48:37,022 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:48:37,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:48:37,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:48:37,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:48:37,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:48:37,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:48:37,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:48:37,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:48:37,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:48:37,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:48:37,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:48:37,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:48:37,025 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:48:37,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:48:37,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:48:37,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:48:37,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:48:37,026 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:48:37,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:48:37,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:48:37,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:48:37,028 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:48:37,029 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:48:37,029 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 20:48:37,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:48:37,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:48:37,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:48:37,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:48:37,338 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:48:37,338 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 20:48:37,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9a8ed35/efebb5d9d42d4e2e99d9b0f39df7baa9/FLAGfe5cc64ad [2019-11-28 20:48:37,902 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:48:37,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-11-28 20:48:37,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9a8ed35/efebb5d9d42d4e2e99d9b0f39df7baa9/FLAGfe5cc64ad [2019-11-28 20:48:38,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9a8ed35/efebb5d9d42d4e2e99d9b0f39df7baa9 [2019-11-28 20:48:38,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:48:38,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:48:38,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:38,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:48:38,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:48:38,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:38,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796fae81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38, skipping insertion in model container [2019-11-28 20:48:38,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:38,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:48:38,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:48:38,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:38,841 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:48:38,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:38,947 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:48:38,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38 WrapperNode [2019-11-28 20:48:38,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:38,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:38,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:48:38,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:48:38,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:38,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:39,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:48:39,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:48:39,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:48:39,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (1/1) ... [2019-11-28 20:48:39,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:48:39,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:48:39,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:48:39,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:48:39,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (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 20:48:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:48:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:48:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:48:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:48:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:48:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 20:48:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:48:39,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:48:39,537 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:48:39,537 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:48:39,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:39 BoogieIcfgContainer [2019-11-28 20:48:39,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:48:39,539 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:48:39,539 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:48:39,543 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:48:39,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:39,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:48:38" (1/3) ... [2019-11-28 20:48:39,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c0eef0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:39, skipping insertion in model container [2019-11-28 20:48:39,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:39,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:38" (2/3) ... [2019-11-28 20:48:39,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c0eef0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:39, skipping insertion in model container [2019-11-28 20:48:39,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:39,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:39" (3/3) ... [2019-11-28 20:48:39,549 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2019-11-28 20:48:39,599 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:48:39,599 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:48:39,599 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:48:39,600 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:48:39,600 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:48:39,600 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:48:39,600 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:48:39,601 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:48:39,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:48:39,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:48:39,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:39,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:39,650 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:39,650 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:48:39,651 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:48:39,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:48:39,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:48:39,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:39,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:39,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:39,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:48:39,664 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 20:48:39,664 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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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 20:48:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:39,673 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:48:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:39,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373944720] [2019-11-28 20:48:39,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:39,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-11-28 20:48:39,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:39,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943176189] [2019-11-28 20:48:39,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:39,931 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:39,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:39,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-11-28 20:48:39,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:39,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19543609] [2019-11-28 20:48:39,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:40,051 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 20:48:40,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19543609] [2019-11-28 20:48:40,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:40,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:48:40,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781254791] [2019-11-28 20:48:40,948 WARN L192 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-11-28 20:48:41,800 WARN L192 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 20:48:41,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:48:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:48:41,834 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-11-28 20:48:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:41,918 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-28 20:48:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:48:41,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 20:48:41,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 20:48:41,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2019-11-28 20:48:41,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:48:41,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:48:41,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 20:48:41,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:41,933 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:48:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 20:48:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-28 20:48:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:48:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-28 20:48:41,977 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:48:41,977 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:48:41,977 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:48:41,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-28 20:48:41,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:48:41,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:48:41,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:48:41,981 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 20:48:41,981 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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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 20:48:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-11-28 20:48:41,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147838460] [2019-11-28 20:48:41,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-11-28 20:48:42,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361701640] [2019-11-28 20:48:42,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-11-28 20:48:42,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943486842] [2019-11-28 20:48:42,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:43,021 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-11-28 20:48:44,178 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 139 [2019-11-28 20:48:44,564 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2019-11-28 20:48:44,710 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-28 20:48:44,727 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:48:44,728 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:48:44,728 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:48:44,728 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:48:44,728 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:48:44,728 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:44,729 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:48:44,729 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:48:44,729 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2019-11-28 20:48:44,729 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:48:44,730 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:48:44,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 20:48:44,789 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 20:48:44,791 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 20:48:44,793 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 20:48:44,795 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 20:48:44,797 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 20:48:44,799 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 20:48:44,800 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 20:48:44,802 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 20:48:44,803 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 20:48:44,807 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 20:48:44,816 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 20:48:44,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:44,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:44,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:44,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:44,838 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 20:48:45,361 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-28 20:48:47,075 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-28 20:48:47,078 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 20:48:47,080 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 20:48:47,087 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 20:48:47,090 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 20:48:47,092 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 20:48:47,095 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 20:48:47,097 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 20:48:47,100 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 20:48:47,103 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 20:48:47,108 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 20:48:47,110 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 20:48:47,111 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 20:48:47,112 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 20:48:47,114 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 20:48:47,116 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 20:48:47,119 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 20:48:47,121 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 20:48:47,133 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 20:48:47,371 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 20:48:47,706 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-28 20:48:49,453 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-11-28 20:48:55,314 WARN L192 SmtUtils]: Spent 5.86 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-11-28 20:48:55,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:48:55,475 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,482 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 20:48:55,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:55,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:55,521 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 20:48:55,535 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 20:48:55,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:55,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,570 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 20:48:55,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:48:55,600 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 20:48:55,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:55,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:55,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,615 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 20:48:55,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,626 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 20:48:55,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,639 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 20:48:55,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,657 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 20:48:55,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:55,676 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 20:48:55,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:48:55,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:55,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,699 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 20:48:55,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:55,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,735 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 20:48:55,743 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 20:48:55,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,747 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 20:48:55,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 20:48:55,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,756 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 20:48:55,761 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 20:48:55,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:55,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:55,771 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 20:48:55,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 20:48:55,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:55,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,791 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 20:48:55,802 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 20:48:55,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:55,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,804 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:48:55,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,805 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:48:55,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:55,806 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 20:48:55,813 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 20:48:55,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:55,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:55,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:48:55,837 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 20:48:55,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:55,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:55,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:55,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:55,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:55,843 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 20:48:55,865 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 20:48:55,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:55,869 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-28 20:48:55,869 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2019-11-28 20:48:55,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:57,152 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2019-11-28 20:48:57,152 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-11-28 20:49:00,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:49:00,147 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 20:49:00,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:00,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:00,155 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 20:49:00,163 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 20:49:00,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:00,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:00,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:00,174 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 20:49:00,179 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 20:49:00,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:00,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:00,182 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 20:49:00,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:00,213 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:00,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:00,226 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 20:49:00,232 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 20:49:00,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:00,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:00,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:00,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,257 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 20:49:00,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:00,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:00,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,280 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 20:49:00,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:00,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:00,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,300 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 20:49:00,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:00,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:00,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:00,304 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,310 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 20:49:00,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:00,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:00,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:00,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:00,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:00,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:00,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:00,342 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 20:49:00,342 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) [2019-11-28 20:49:00,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:00,360 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:00,361 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:00,362 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-11-28 20:49:00,427 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 20:49:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:00,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:00,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:00,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:49:00,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:00,586 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 20:49:00,591 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 20:49:00,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 20:49:00,644 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 20:49:00,648 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 20:49:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:49:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:49:00,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-28 20:49:00,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:00,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-28 20:49:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:00,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-28 20:49:00,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:00,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-11-28 20:49:00,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:00,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-11-28 20:49:00,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:49:00,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:49:00,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-28 20:49:00,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:00,669 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 20:49:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-28 20:49:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 20:49:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:49:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 20:49:00,674 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:49:00,674 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:49:00,674 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:49:00,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 20:49:00,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:00,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:00,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:00,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:00,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:49:00,679 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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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 20:49:00,680 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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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 20:49:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2019-11-28 20:49:00,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:00,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941061279] [2019-11-28 20:49:00,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:00,766 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 20:49:00,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941061279] [2019-11-28 20:49:00,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:00,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:49:00,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432612648] [2019-11-28 20:49:00,768 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2019-11-28 20:49:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:00,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477390815] [2019-11-28 20:49:00,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:00,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:00,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:49:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:49:00,912 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 20:49:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:00,938 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-28 20:49:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:49:00,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 20:49:00,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:00,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2019-11-28 20:49:00,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:49:00,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:49:00,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2019-11-28 20:49:00,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:00,944 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 20:49:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2019-11-28 20:49:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 20:49:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:49:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 20:49:00,947 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 20:49:00,947 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 20:49:00,947 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:49:00,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-28 20:49:00,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:00,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:00,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:00,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:00,951 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:49:00,951 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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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 20:49:00,951 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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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 20:49:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:00,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2019-11-28 20:49:00,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:00,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201664228] [2019-11-28 20:49:00,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,046 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,047 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2019-11-28 20:49:01,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161871692] [2019-11-28 20:49:01,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2019-11-28 20:49:01,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160086152] [2019-11-28 20:49:01,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:01,117 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 20:49:01,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160086152] [2019-11-28 20:49:01,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:01,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:49:01,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207306973] [2019-11-28 20:49:01,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:49:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:49:01,233 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 20:49:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:01,292 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-28 20:49:01,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:49:01,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2019-11-28 20:49:01,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:01,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2019-11-28 20:49:01,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:49:01,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:49:01,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2019-11-28 20:49:01,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:01,300 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-28 20:49:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2019-11-28 20:49:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-28 20:49:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:49:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 20:49:01,303 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 20:49:01,303 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 20:49:01,303 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:49:01,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 20:49:01,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:01,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:01,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:01,306 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:01,307 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:49:01,307 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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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 20:49:01,307 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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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 20:49:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2019-11-28 20:49:01,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691936013] [2019-11-28 20:49:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:01,435 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 20:49:01,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691936013] [2019-11-28 20:49:01,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302139786] [2019-11-28 20:49:01,436 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 20:49:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:01,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 20:49:01,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:01,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:01,629 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 20:49:01,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:01,659 INFO L614 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-28 20:49:01,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:49:01,664 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-11-28 20:49:01,695 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 20:49:01,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:01,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:01,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:49:01,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-28 20:49:01,699 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 20:49:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:01,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-28 20:49:01,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477440057] [2019-11-28 20:49:01,700 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2019-11-28 20:49:01,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719637131] [2019-11-28 20:49:01,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:01,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:49:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:49:01,814 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-28 20:49:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:01,882 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-28 20:49:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:49:01,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-28 20:49:01,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:01,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 20:49:01,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 20:49:01,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:49:01,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-28 20:49:01,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:01,885 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:49:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-28 20:49:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 20:49:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:49:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 20:49:01,887 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:49:01,887 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:49:01,887 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:49:01,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-28 20:49:01,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:49:01,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:01,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:01,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:01,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:49:01,888 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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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~mem7.base, append_#t~mem7.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.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 20:49:01,888 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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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 20:49:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2019-11-28 20:49:01,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103183340] [2019-11-28 20:49:01,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2019-11-28 20:49:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826034148] [2019-11-28 20:49:01,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,977 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2019-11-28 20:49:01,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588631060] [2019-11-28 20:49:01,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:02,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:07,391 WARN L192 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 316 DAG size of output: 243 [2019-11-28 20:49:07,997 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-11-28 20:49:08,000 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:08,000 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:08,000 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:08,000 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:08,000 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:08,000 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:08,000 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:08,001 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:08,001 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2019-11-28 20:49:08,001 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:08,001 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:08,007 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 20:49:08,020 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 20:49:08,021 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 20:49:08,022 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 20:49:08,023 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 20:49:08,026 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 20:49:08,027 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 20:49:08,031 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 20:49:08,032 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 20:49:08,034 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 20:49:08,036 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 20:49:08,039 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 20:49:08,041 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 20:49:08,043 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 20:49:08,045 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 20:49:08,047 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 20:49:08,050 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 20:49:08,051 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 20:49:08,052 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 20:49:08,055 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 20:49:08,057 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 20:49:08,059 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 20:49:08,061 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 20:49:08,062 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 20:49:08,064 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 20:49:08,067 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 20:49:08,070 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 20:49:08,072 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 20:49:08,079 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 20:49:08,081 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 20:49:08,082 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 20:49:08,084 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 20:49:08,086 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 20:49:08,088 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 20:49:08,090 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 20:49:08,366 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 20:49:08,370 INFO L168 Benchmark]: Toolchain (without parser) took 30126.88 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 537.4 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -304.5 MB). Peak memory consumption was 580.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:08,372 INFO L168 Benchmark]: CDTParser took 0.21 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 20:49:08,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:08,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.07 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 20:49:08,374 INFO L168 Benchmark]: Boogie Preprocessor took 56.09 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 20:49:08,374 INFO L168 Benchmark]: RCFGBuilder took 478.66 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.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:08,375 INFO L168 Benchmark]: BuchiAutomizer took 28829.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 391.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.2 MB). Peak memory consumption was 570.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:08,378 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.21 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 706.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.07 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 56.09 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 478.66 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.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28829.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 391.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.2 MB). Peak memory consumption was 570.0 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...