./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer --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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/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.2.0-a4ecdab [2020-11-29 19:26:25,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:26:25,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:26:25,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:26:25,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:26:25,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:26:25,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:26:26,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:26:26,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:26:26,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:26:26,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:26:26,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:26:26,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:26:26,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:26:26,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:26:26,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:26:26,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:26:26,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:26:26,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:26:26,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:26:26,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:26:26,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:26:26,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:26:26,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:26:26,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:26:26,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:26:26,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:26:26,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:26:26,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:26:26,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:26:26,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:26:26,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:26:26,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:26:26,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:26:26,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:26:26,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:26:26,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:26:26,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:26:26,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:26:26,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:26:26,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:26:26,099 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 19:26:26,147 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:26:26,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:26:26,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:26:26,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:26:26,150 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:26:26,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:26:26,150 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:26:26,150 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:26:26,151 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:26:26,151 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:26:26,151 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:26:26,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:26:26,152 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:26:26,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:26:26,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:26:26,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:26:26,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:26:26,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:26:26,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:26:26,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:26:26,154 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:26:26,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:26:26,155 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:26:26,155 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:26:26,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:26:26,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:26:26,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:26:26,156 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:26:26,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:26:26,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:26:26,157 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:26:26,158 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:26:26,159 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:26:26,159 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer 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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-11-29 19:26:26,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:26:26,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:26:26,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:26:26,562 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:26:26,565 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:26:26,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-11-29 19:26:26,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/data/5cb7a22ae/8d2bed3a5cb24f3f877360fb5a189418/FLAGc427d3316 [2020-11-29 19:26:27,430 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:26:27,431 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-11-29 19:26:27,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/data/5cb7a22ae/8d2bed3a5cb24f3f877360fb5a189418/FLAGc427d3316 [2020-11-29 19:26:27,692 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/data/5cb7a22ae/8d2bed3a5cb24f3f877360fb5a189418 [2020-11-29 19:26:27,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:26:27,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:26:27,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:26:27,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:26:27,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:26:27,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:26:27" (1/1) ... [2020-11-29 19:26:27,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e676dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:27, skipping insertion in model container [2020-11-29 19:26:27,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:26:27" (1/1) ... [2020-11-29 19:26:27,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:26:27,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:26:28,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:26:28,363 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:26:28,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:26:28,490 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:26:28,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28 WrapperNode [2020-11-29 19:26:28,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:26:28,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:26:28,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:26:28,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:26:28,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:26:28,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:26:28,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:26:28,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:26:28,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... [2020-11-29 19:26:28,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:26:28,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:26:28,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:26:28,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:26:28,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 19:26:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 19:26:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:26:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 19:26:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:26:28,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-29 19:26:28,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:26:28,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:26:28,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:26:29,297 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:26:29,297 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-29 19:26:29,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:26:29 BoogieIcfgContainer [2020-11-29 19:26:29,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:26:29,300 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:26:29,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:26:29,305 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:26:29,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:26:29,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:26:27" (1/3) ... [2020-11-29 19:26:29,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f43dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:26:29, skipping insertion in model container [2020-11-29 19:26:29,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:26:29,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:26:28" (2/3) ... [2020-11-29 19:26:29,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f43dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:26:29, skipping insertion in model container [2020-11-29 19:26:29,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:26:29,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:26:29" (3/3) ... [2020-11-29 19:26:29,311 INFO L373 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2020-11-29 19:26:29,387 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:26:29,387 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:26:29,387 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:26:29,388 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:26:29,388 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:26:29,388 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:26:29,388 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:26:29,389 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:26:29,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-11-29 19:26:29,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:26:29,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:29,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:29,438 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:26:29,448 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-29 19:26:29,448 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:26:29,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-11-29 19:26:29,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:26:29,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:29,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:29,451 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:26:29,451 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-29 19:26:29,461 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 13#L543-3true [2020-11-29 19:26:29,462 INFO L796 eck$LassoCheckResult]: Loop: 13#L543-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 5#L534true assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 9#L534-2true call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L529true main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 10#L543-1true assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 13#L543-3true [2020-11-29 19:26:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:29,470 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 19:26:29,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:29,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158197255] [2020-11-29 19:26:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:29,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:29,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:29,679 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2020-11-29 19:26:29,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:29,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445310484] [2020-11-29 19:26:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:29,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:29,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:29,820 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2020-11-29 19:26:29,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:29,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488069492] [2020-11-29 19:26:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:26:30,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488069492] [2020-11-29 19:26:30,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:30,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:26:30,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883143398] [2020-11-29 19:26:31,589 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2020-11-29 19:26:31,694 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:31,715 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:32,694 WARN L193 SmtUtils]: Spent 977.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-11-29 19:26:32,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:32,721 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:32,747 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:33,585 WARN L193 SmtUtils]: Spent 837.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-11-29 19:26:33,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:33,590 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-11-29 19:26:33,590 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:739, output treesize:723 [2020-11-29 19:26:34,288 WARN L193 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-11-29 19:26:34,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:26:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:26:34,307 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2020-11-29 19:26:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:34,372 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-11-29 19:26:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:26:34,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-11-29 19:26:34,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-29 19:26:34,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2020-11-29 19:26:34,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-29 19:26:34,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-29 19:26:34,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-11-29 19:26:34,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:26:34,382 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-29 19:26:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-11-29 19:26:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-11-29 19:26:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-29 19:26:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-11-29 19:26:34,408 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-11-29 19:26:34,408 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-11-29 19:26:34,409 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:26:34,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-11-29 19:26:34,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 19:26:34,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:34,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:34,411 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 19:26:34,411 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-29 19:26:34,411 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 52#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 53#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 60#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 48#L534-2 [2020-11-29 19:26:34,411 INFO L796 eck$LassoCheckResult]: Loop: 48#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 49#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 54#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 56#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 59#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 48#L534-2 [2020-11-29 19:26:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2020-11-29 19:26:34,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:34,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040441053] [2020-11-29 19:26:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:34,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:34,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:34,518 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2020-11-29 19:26:34,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:34,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849950822] [2020-11-29 19:26:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:34,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:34,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:34,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2020-11-29 19:26:34,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:34,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476618217] [2020-11-29 19:26:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:34,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:34,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:34,753 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:36,013 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 170 DAG size of output: 164 [2020-11-29 19:26:36,054 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:36,083 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:37,369 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 165 [2020-11-29 19:26:37,370 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:37,408 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:37,429 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:38,913 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 166 [2020-11-29 19:26:38,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:38,918 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-11-29 19:26:38,919 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:861, output treesize:905 [2020-11-29 19:26:40,214 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 166 [2020-11-29 19:26:40,936 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 142 [2020-11-29 19:26:41,194 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-11-29 19:26:41,204 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:26:41,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:26:41,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:26:41,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:26:41,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:26:41,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:41,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:26:41,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:26:41,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2020-11-29 19:26:41,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:26:41,206 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:26:41,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:41,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:42,260 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2020-11-29 19:26:44,214 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2020-11-29 19:26:44,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:26:44,675 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-29 19:26:45,087 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-29 19:26:46,914 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2020-11-29 19:26:52,567 WARN L193 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2020-11-29 19:26:52,676 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:26:52,681 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:52,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:52,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:52,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:52,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:52,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:52,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:52,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:52,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:52,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:52,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:52,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:52,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:52,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:52,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:52,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:26:52,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:26:52,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:52,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:52,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:52,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:52,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:52,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:52,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:52,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:52,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:52,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:52,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:52,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:52,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:52,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:52,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:52,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:26:52,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:26:52,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:52,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:52,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:52,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:52,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:52,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:52,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:52,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:52,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:52,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:52,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:52,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:52,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:52,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:52,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:52,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:52,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:52,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:52,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:26:53,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:26:53,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:26:53,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/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 [2020-11-29 19:26:53,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:26:53,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:26:53,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:26:53,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:26:53,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 19:26:53,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:26:53,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:26:53,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:26:53,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:26:53,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:26:53,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:26:53,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:26:53,500 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-11-29 19:26:53,500 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/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 [2020-11-29 19:26:53,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:26:53,615 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:26:53,615 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:26:53,616 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2020-11-29 19:26:53,764 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-11-29 19:26:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:53,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:26:53,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:26:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:53,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:26:53,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:26:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:26:53,915 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 [2020-11-29 19:26:53,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-11-29 19:26:53,954 INFO L75 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. [2020-11-29 19:26:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 19:26:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-29 19:26:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-11-29 19:26:53,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2020-11-29 19:26:53,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:26:53,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2020-11-29 19:26:53,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:26:53,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2020-11-29 19:26:53,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:26:53,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2020-11-29 19:26:53,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:53,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2020-11-29 19:26:53,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 19:26:53,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-29 19:26:53,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2020-11-29 19:26:53,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:26:53,974 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-11-29 19:26:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2020-11-29 19:26:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-29 19:26:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-29 19:26:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-11-29 19:26:53,977 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-11-29 19:26:53,978 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-11-29 19:26:53,978 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:26:53,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-11-29 19:26:53,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:53,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:53,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:53,980 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:53,980 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-29 19:26:53,981 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 193#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 194#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 201#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 203#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 188#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 195#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 196#L543-4 assume !(main_~length~0 > 0); 200#L556-1 [2020-11-29 19:26:53,981 INFO L796 eck$LassoCheckResult]: Loop: 200#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 200#L556-1 [2020-11-29 19:26:53,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2020-11-29 19:26:53,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:53,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245894073] [2020-11-29 19:26:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:26:54,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245894073] [2020-11-29 19:26:54,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:54,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:26:54,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882686123] [2020-11-29 19:26:54,082 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:26:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2020-11-29 19:26:54,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:54,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010864260] [2020-11-29 19:26:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:54,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:54,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:54,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:54,196 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-29 19:26:54,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:26:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:26:54,263 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-11-29 19:26:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:54,314 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-11-29 19:26:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:26:54,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-11-29 19:26:54,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:54,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2020-11-29 19:26:54,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-29 19:26:54,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-29 19:26:54,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2020-11-29 19:26:54,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:26:54,321 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-11-29 19:26:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2020-11-29 19:26:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-11-29 19:26:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-29 19:26:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-11-29 19:26:54,323 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-11-29 19:26:54,323 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-11-29 19:26:54,323 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:26:54,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-11-29 19:26:54,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:54,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:54,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:54,325 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:54,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-29 19:26:54,326 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 234#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 235#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 244#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 246#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 231#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 238#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 239#L543-4 assume main_~length~0 > 0; 236#L548 assume !(main_~length~0 < 0); 237#L548-2 call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 243#L556-1 [2020-11-29 19:26:54,326 INFO L796 eck$LassoCheckResult]: Loop: 243#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 243#L556-1 [2020-11-29 19:26:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2020-11-29 19:26:54,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:54,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000086883] [2020-11-29 19:26:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:54,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:54,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:54,439 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2020-11-29 19:26:54,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:54,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920624083] [2020-11-29 19:26:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:54,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:54,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:54,453 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2020-11-29 19:26:54,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:54,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807887888] [2020-11-29 19:26:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:26:54,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807887888] [2020-11-29 19:26:54,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:54,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:26:54,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354157780] [2020-11-29 19:26:54,627 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-29 19:26:54,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:26:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:26:54,686 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-11-29 19:26:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:54,747 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-11-29 19:26:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:26:54,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2020-11-29 19:26:54,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:54,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2020-11-29 19:26:54,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-29 19:26:54,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-11-29 19:26:54,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2020-11-29 19:26:54,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:26:54,751 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-29 19:26:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2020-11-29 19:26:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-11-29 19:26:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-29 19:26:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-11-29 19:26:54,754 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-29 19:26:54,754 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-29 19:26:54,754 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:26:54,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-11-29 19:26:54,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:54,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:54,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:54,760 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:54,761 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-29 19:26:54,761 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 288#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 289#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 301#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 290#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 291#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 297#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 298#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 302#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 304#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 303#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 295#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 296#L543-4 assume main_~length~0 > 0; 293#L548 assume !(main_~length~0 < 0); 294#L548-2 call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 300#L556-1 [2020-11-29 19:26:54,761 INFO L796 eck$LassoCheckResult]: Loop: 300#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 300#L556-1 [2020-11-29 19:26:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2020-11-29 19:26:54,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:54,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882197102] [2020-11-29 19:26:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:26:54,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882197102] [2020-11-29 19:26:54,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897983158] [2020-11-29 19:26:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9cafaa11-cbb2-488b-982d-1a361cd53868/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:26:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:55,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-29 19:26:55,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:26:55,096 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 19:26:55,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:55,107 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,107 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-29 19:26:55,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:26:55,146 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 19:26:55,147 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,168 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:55,168 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,168 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2020-11-29 19:26:55,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:26:55,257 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2020-11-29 19:26:55,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:55,285 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:26:55,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:28 [2020-11-29 19:26:55,431 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 19:26:55,435 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:55,435 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2020-11-29 19:26:55,436 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:26:55,459 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:26:55,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2020-11-29 19:26:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:26:55,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:26:55,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-11-29 19:26:55,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522575312] [2020-11-29 19:26:55,463 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:26:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2020-11-29 19:26:55,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:55,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443178706] [2020-11-29 19:26:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:55,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:55,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:55,479 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:55,598 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-29 19:26:55,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:55,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:26:55,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:26:55,653 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-11-29 19:26:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:55,856 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-11-29 19:26:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:26:55,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-11-29 19:26:55,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:55,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2020-11-29 19:26:55,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-29 19:26:55,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-29 19:26:55,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-11-29 19:26:55,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:26:55,860 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-29 19:26:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-11-29 19:26:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-11-29 19:26:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-29 19:26:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-11-29 19:26:55,862 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-29 19:26:55,862 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-11-29 19:26:55,862 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 19:26:55,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-11-29 19:26:55,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-11-29 19:26:55,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:26:55,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:26:55,864 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:55,864 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-11-29 19:26:55,864 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 381#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 382#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 395#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 397#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 386#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 391#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 392#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 396#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 383#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 384#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 389#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 390#L543-4 assume main_~length~0 > 0; 387#L548 assume !(main_~length~0 < 0); 388#L548-2 call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 394#L556-1 [2020-11-29 19:26:55,864 INFO L796 eck$LassoCheckResult]: Loop: 394#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 394#L556-1 [2020-11-29 19:26:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:55,865 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2020-11-29 19:26:55,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:55,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900698233] [2020-11-29 19:26:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:55,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:55,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:56,004 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2020-11-29 19:26:56,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:56,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867679201] [2020-11-29 19:26:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:56,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:56,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:56,019 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2020-11-29 19:26:56,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:56,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638825346] [2020-11-29 19:26:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:56,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:56,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:56,156 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:56,312 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-29 19:27:31,914 WARN L193 SmtUtils]: Spent 35.54 s on a formula simplification. DAG size of input: 395 DAG size of output: 333 [2020-11-29 19:27:32,347 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:27:38,856 WARN L193 SmtUtils]: Spent 6.51 s on a formula simplification that was a NOOP. DAG size: 232 [2020-11-29 19:27:38,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:27:38,911 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:27:44,723 WARN L193 SmtUtils]: Spent 5.81 s on a formula simplification that was a NOOP. DAG size: 228 [2020-11-29 19:27:44,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:27:44,793 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:27:50,778 WARN L193 SmtUtils]: Spent 5.98 s on a formula simplification that was a NOOP. DAG size: 225 [2020-11-29 19:27:50,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:27:50,830 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:27:56,647 WARN L193 SmtUtils]: Spent 5.82 s on a formula simplification that was a NOOP. DAG size: 222 [2020-11-29 19:27:56,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:27:56,695 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:28:02,627 WARN L193 SmtUtils]: Spent 5.93 s on a formula simplification that was a NOOP. DAG size: 218 [2020-11-29 19:28:02,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:28:02,663 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 19:28:08,057 WARN L193 SmtUtils]: Spent 5.39 s on a formula simplification that was a NOOP. DAG size: 215 [2020-11-29 19:28:08,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:28:08,124 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2020-11-29 19:28:08,125 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:9823, output treesize:10065 [2020-11-29 19:28:13,462 WARN L193 SmtUtils]: Spent 5.26 s on a formula simplification that was a NOOP. DAG size: 215 [2020-11-29 19:28:13,469 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:28:13,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:28:13,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:28:13,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:28:13,470 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:28:13,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:28:13,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:28:13,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:28:13,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2020-11-29 19:28:13,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:28:13,470 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:28:13,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:13,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:28:16,649 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-29 19:28:16,652 INFO L168 Benchmark]: Toolchain (without parser) took 108953.57 ms. Allocated memory was 117.4 MB in the beginning and 207.6 MB in the end (delta: 90.2 MB). Free memory was 91.1 MB in the beginning and 128.5 MB in the end (delta: -37.3 MB). Peak memory consumption was 128.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:28:16,652 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 88.1 MB. Free memory is still 49.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:28:16,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.25 ms. Allocated memory is still 117.4 MB. Free memory was 91.1 MB in the beginning and 80.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:28:16,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.95 ms. Allocated memory is still 117.4 MB. Free memory was 80.6 MB in the beginning and 78.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:28:16,654 INFO L168 Benchmark]: Boogie Preprocessor took 60.78 ms. Allocated memory is still 117.4 MB. Free memory was 78.5 MB in the beginning and 77.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:28:16,655 INFO L168 Benchmark]: RCFGBuilder took 668.02 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 57.5 MB in the end (delta: 19.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:28:16,656 INFO L168 Benchmark]: BuchiAutomizer took 107350.34 ms. Allocated memory was 117.4 MB in the beginning and 207.6 MB in the end (delta: 90.2 MB). Free memory was 57.1 MB in the beginning and 128.5 MB in the end (delta: -71.3 MB). Peak memory consumption was 96.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:28:16,660 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 88.1 MB. Free memory is still 49.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 785.25 ms. Allocated memory is still 117.4 MB. Free memory was 91.1 MB in the beginning and 80.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.95 ms. Allocated memory is still 117.4 MB. Free memory was 80.6 MB in the beginning and 78.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.78 ms. Allocated memory is still 117.4 MB. Free memory was 78.5 MB in the beginning and 77.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 668.02 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 57.5 MB in the end (delta: 19.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 107350.34 ms. Allocated memory was 117.4 MB in the beginning and 207.6 MB in the end (delta: 90.2 MB). Free memory was 57.1 MB in the beginning and 128.5 MB in the end (delta: -71.3 MB). Peak memory consumption was 96.0 MB. Max. memory is 16.1 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...