./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/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 f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/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.1.23-1dbac8b [2018-11-10 03:28:12,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:28:12,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:28:12,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:28:12,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:28:12,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:28:12,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:28:12,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:28:12,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:28:12,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:28:12,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:28:12,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:28:12,046 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:28:12,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:28:12,047 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:28:12,048 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:28:12,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:28:12,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:28:12,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:28:12,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:28:12,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:28:12,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:28:12,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:28:12,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:28:12,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:28:12,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:28:12,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:28:12,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:28:12,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:28:12,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:28:12,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:28:12,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:28:12,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:28:12,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:28:12,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:28:12,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:28:12,058 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:28:12,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:28:12,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:28:12,068 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:28:12,068 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:28:12,068 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:28:12,069 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:28:12,069 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:28:12,069 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:28:12,069 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:28:12,069 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:28:12,069 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:28:12,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:28:12,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:28:12,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:28:12,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:28:12,071 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:28:12,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:28:12,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:28:12,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:28:12,071 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:28:12,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:28:12,072 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:28:12,072 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:28:12,072 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:28:12,073 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/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 -> f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 [2018-11-10 03:28:12,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:28:12,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:28:12,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:28:12,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:28:12,113 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:28:12,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-11-10 03:28:12,156 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/data/ca89bd214/dbf2882600b449708c861ec71f95e361/FLAGe7cf95e13 [2018-11-10 03:28:12,594 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:28:12,595 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-11-10 03:28:12,604 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/data/ca89bd214/dbf2882600b449708c861ec71f95e361/FLAGe7cf95e13 [2018-11-10 03:28:12,614 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/data/ca89bd214/dbf2882600b449708c861ec71f95e361 [2018-11-10 03:28:12,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:28:12,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:28:12,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:28:12,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:28:12,622 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:28:12,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0f78a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12, skipping insertion in model container [2018-11-10 03:28:12,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:28:12,665 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:28:12,845 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:28:12,850 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:28:12,872 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:28:12,903 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:28:12,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12 WrapperNode [2018-11-10 03:28:12,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:28:12,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:28:12,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:28:12,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:28:12,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:28:12,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:28:12,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:28:12,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:28:12,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... [2018-11-10 03:28:12,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:28:12,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:28:12,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:28:12,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:28:12,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/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 [2018-11-10 03:28:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 03:28:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 03:28:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:28:13,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:28:13,243 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:28:13,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:28:13 BoogieIcfgContainer [2018-11-10 03:28:13,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:28:13,244 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:28:13,244 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:28:13,248 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:28:13,249 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:28:13,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:28:12" (1/3) ... [2018-11-10 03:28:13,249 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b41ff3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:28:13, skipping insertion in model container [2018-11-10 03:28:13,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:28:13,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:12" (2/3) ... [2018-11-10 03:28:13,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b41ff3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:28:13, skipping insertion in model container [2018-11-10 03:28:13,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:28:13,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:28:13" (3/3) ... [2018-11-10 03:28:13,251 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-11-10 03:28:13,293 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:28:13,294 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:28:13,294 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:28:13,294 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:28:13,294 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:28:13,294 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:28:13,294 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:28:13,294 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:28:13,294 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:28:13,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2018-11-10 03:28:13,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 03:28:13,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:28:13,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:28:13,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 03:28:13,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:13,321 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:28:13,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2018-11-10 03:28:13,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 03:28:13,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:28:13,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:28:13,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 03:28:13,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:13,328 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.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~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 37#L637true SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 40#L637-1true main_~length~0 := 0; 41#L639-3true [2018-11-10 03:28:13,329 INFO L795 eck$LassoCheckResult]: Loop: 41#L639-3true assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 30#L629true SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 11#L629-1true SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 13#L629-2true havoc append_#t~mem2.base, append_#t~mem2.offset; 6#L630true SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 8#L630-1true assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 35#L630-3true SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 38#L630-4true havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 21#L633true SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 23#L633-1true assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 33#L639-1true assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 41#L639-3true [2018-11-10 03:28:13,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 03:28:13,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:13,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:13,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash 619840402, now seen corresponding path program 1 times [2018-11-10 03:28:13,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:13,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:13,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1394771889, now seen corresponding path program 1 times [2018-11-10 03:28:13,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:13,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:13,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:13,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:14,125 WARN L179 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-11-10 03:28:14,251 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-10 03:28:14,364 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:28:14,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:28:14,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:28:14,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:28:14,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:28:14,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:28:14,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:28:14,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:28:14,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 03:28:14,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:28:14,367 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:28:14,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,732 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-11-10 03:28:14,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:14,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:15,049 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:28:15,053 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:28:15,054 INFO L122 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 [2018-11-10 03:28:15,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,073 INFO L122 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 [2018-11-10 03:28:15,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,078 INFO L122 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 [2018-11-10 03:28:15,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,081 INFO L122 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 [2018-11-10 03:28:15,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,087 INFO L122 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 [2018-11-10 03:28:15,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,089 INFO L122 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 [2018-11-10 03:28:15,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,091 INFO L122 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 [2018-11-10 03:28:15,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,094 INFO L122 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 [2018-11-10 03:28:15,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,096 INFO L122 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 [2018-11-10 03:28:15,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,098 INFO L122 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 [2018-11-10 03:28:15,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,100 INFO L122 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 [2018-11-10 03:28:15,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,102 INFO L122 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 [2018-11-10 03:28:15,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,104 INFO L122 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 [2018-11-10 03:28:15,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,106 INFO L122 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 [2018-11-10 03:28:15,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,108 INFO L122 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 [2018-11-10 03:28:15,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,110 INFO L122 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 [2018-11-10 03:28:15,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,113 INFO L122 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 [2018-11-10 03:28:15,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,114 INFO L122 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 [2018-11-10 03:28:15,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,118 INFO L122 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 [2018-11-10 03:28:15,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,121 INFO L122 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 [2018-11-10 03:28:15,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,123 INFO L122 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 [2018-11-10 03:28:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,125 INFO L122 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 [2018-11-10 03:28:15,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,126 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:28:15,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:28:15,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,130 INFO L122 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 [2018-11-10 03:28:15,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,132 INFO L122 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 [2018-11-10 03:28:15,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,134 INFO L122 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 [2018-11-10 03:28:15,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,137 INFO L122 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 [2018-11-10 03:28:15,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,142 INFO L122 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 [2018-11-10 03:28:15,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,144 INFO L122 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 [2018-11-10 03:28:15,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,146 INFO L122 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 [2018-11-10 03:28:15,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,149 INFO L122 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 [2018-11-10 03:28:15,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,152 INFO L122 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 [2018-11-10 03:28:15,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,154 INFO L122 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 [2018-11-10 03:28:15,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,157 INFO L122 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 [2018-11-10 03:28:15,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,159 INFO L122 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 [2018-11-10 03:28:15,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,161 INFO L122 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 [2018-11-10 03:28:15,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,166 INFO L122 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 [2018-11-10 03:28:15,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,173 INFO L122 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 [2018-11-10 03:28:15,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,181 INFO L122 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 [2018-11-10 03:28:15,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,181 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:28:15,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:28:15,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,188 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 03:28:15,189 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:28:15,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,222 INFO L122 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 [2018-11-10 03:28:15,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,260 INFO L122 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 [2018-11-10 03:28:15,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,266 INFO L122 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 [2018-11-10 03:28:15,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,267 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:28:15,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,270 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 03:28:15,270 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:28:15,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,286 INFO L122 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 [2018-11-10 03:28:15,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,296 INFO L122 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 [2018-11-10 03:28:15,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,298 INFO L122 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 [2018-11-10 03:28:15,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,302 INFO L122 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 [2018-11-10 03:28:15,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,304 INFO L122 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 [2018-11-10 03:28:15,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,306 INFO L122 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 [2018-11-10 03:28:15,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,307 INFO L122 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 [2018-11-10 03:28:15,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,309 INFO L122 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 [2018-11-10 03:28:15,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:28:15,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:28:15,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:28:15,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:28:15,311 INFO L122 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 [2018-11-10 03:28:15,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:28:15,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:28:15,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:28:15,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:28:15,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:28:15,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:28:15,317 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:28:15,324 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:28:15,324 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 03:28:15,326 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:28:15,327 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:28:15,327 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:28:15,327 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 37 Supporting invariants [] [2018-11-10 03:28:15,340 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 03:28:15,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:15,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:28:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:15,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:28:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:28:15,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:28:15,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states. Second operand 3 states. [2018-11-10 03:28:15,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states.. Second operand 3 states. Result 104 states and 116 transitions. Complement of second has 5 states. [2018-11-10 03:28:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 03:28:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 03:28:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-10 03:28:15,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 11 letters. [2018-11-10 03:28:15,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:28:15,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 15 letters. Loop has 11 letters. [2018-11-10 03:28:15,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:28:15,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 22 letters. [2018-11-10 03:28:15,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:28:15,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2018-11-10 03:28:15,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:15,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 52 states and 57 transitions. [2018-11-10 03:28:15,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 03:28:15,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 03:28:15,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2018-11-10 03:28:15,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:28:15,517 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:28:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2018-11-10 03:28:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 03:28:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:28:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 03:28:15,536 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:28:15,536 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:28:15,536 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:28:15,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 03:28:15,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:15,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:28:15,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:28:15,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:15,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:15,538 INFO L793 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.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~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 236#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 268#L637-1 main_~length~0 := 0; 269#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 261#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 237#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 238#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 224#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 225#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 229#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 265#L630-4 havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 248#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 249#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 253#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 263#L639-4 assume !(main_~length~0 > 0); 244#L650-2 [2018-11-10 03:28:15,539 INFO L795 eck$LassoCheckResult]: Loop: 244#L650-2 assume true; 233#L650 assume !!(main_~length~0 > 0); 234#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 260#L651-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L651-1 241#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 222#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 223#L652-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 228#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 255#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 244#L650-2 [2018-11-10 03:28:15,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:15,539 INFO L82 PathProgramCache]: Analyzing trace with hash -288255611, now seen corresponding path program 1 times [2018-11-10 03:28:15,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:15,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:28:15,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:15,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:15,609 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:28:15,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 1 times [2018-11-10 03:28:15,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:15,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:28:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:28:15,731 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 03:28:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:15,750 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-10 03:28:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:28:15,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2018-11-10 03:28:15,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:15,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 82 transitions. [2018-11-10 03:28:15,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 03:28:15,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 03:28:15,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 82 transitions. [2018-11-10 03:28:15,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:28:15,776 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-10 03:28:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 82 transitions. [2018-11-10 03:28:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2018-11-10 03:28:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:28:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-10 03:28:15,779 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-10 03:28:15,779 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-10 03:28:15,779 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:28:15,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 56 transitions. [2018-11-10 03:28:15,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:15,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:28:15,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:28:15,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:15,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:15,781 INFO L793 eck$LassoCheckResult]: Stem: 400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.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~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 371#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 403#L637-1 main_~length~0 := 0; 404#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 396#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 372#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 373#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 359#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 360#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 364#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 401#L630-4 havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 383#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 384#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 388#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 398#L639-4 assume main_~length~0 > 0; 381#L644 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644 382#L644-1 SUMMARY for call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset + 0, 4); srcloc: L644-1 387#L644-2 main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem11.base, main_#t~mem11.offset; 380#L645 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L645 354#L645-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 4, 4); srcloc: L645-1 355#L645-2 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset; 356#L646 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L646 405#L646-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 377#L647 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L647 378#L647-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 379#L650-2 [2018-11-10 03:28:15,782 INFO L795 eck$LassoCheckResult]: Loop: 379#L650-2 assume true; 368#L650 assume !!(main_~length~0 > 0); 369#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 395#L651-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L651-1 376#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 357#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 358#L652-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 363#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 390#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 379#L650-2 [2018-11-10 03:28:15,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1166139038, now seen corresponding path program 1 times [2018-11-10 03:28:15,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:15,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:15,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 2 times [2018-11-10 03:28:15,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:15,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:15,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:15,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:15,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2021659484, now seen corresponding path program 1 times [2018-11-10 03:28:15,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:28:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:28:15,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:15,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:28:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:28:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:28:15,977 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-10 03:28:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:16,008 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-10 03:28:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:28:16,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 124 transitions. [2018-11-10 03:28:16,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:16,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 90 states and 97 transitions. [2018-11-10 03:28:16,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 03:28:16,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 03:28:16,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 97 transitions. [2018-11-10 03:28:16,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:28:16,012 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-11-10 03:28:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 97 transitions. [2018-11-10 03:28:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 52. [2018-11-10 03:28:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:28:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-10 03:28:16,014 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-10 03:28:16,014 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-10 03:28:16,014 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:28:16,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 55 transitions. [2018-11-10 03:28:16,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:16,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:28:16,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:28:16,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:16,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:16,019 INFO L793 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.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~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 549#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 581#L637-1 main_~length~0 := 0; 582#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 575#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 552#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 553#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 539#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 540#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 544#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 580#L630-4 havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 563#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 564#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 567#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 577#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 574#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 550#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 551#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 537#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 538#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 542#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 579#L630-4 havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 561#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 562#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 566#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 576#L639-4 assume main_~length~0 > 0; 559#L644 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644 560#L644-1 SUMMARY for call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset + 0, 4); srcloc: L644-1 565#L644-2 main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem11.base, main_#t~mem11.offset; 558#L645 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L645 532#L645-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 4, 4); srcloc: L645-1 533#L645-2 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset; 534#L646 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L646 583#L646-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 555#L647 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L647 556#L647-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 557#L650-2 [2018-11-10 03:28:16,019 INFO L795 eck$LassoCheckResult]: Loop: 557#L650-2 assume true; 546#L650 assume !!(main_~length~0 > 0); 547#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 573#L651-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L651-1 554#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 535#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 536#L652-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 541#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 568#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 557#L650-2 [2018-11-10 03:28:16,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:16,020 INFO L82 PathProgramCache]: Analyzing trace with hash 88532297, now seen corresponding path program 1 times [2018-11-10 03:28:16,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:16,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:16,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:28:16,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:28:16,096 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e6a2b30-b2e0-464b-99da-0584d1c297e5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:28:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:16,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:28:16,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:28:16,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:28:16,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-10 03:28:16,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2018-11-10 03:28:16,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-10 03:28:16,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-10 03:28:16,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:28:16,241 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-11-10 03:28:16,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 03:28:16,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-10 03:28:16,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:28:16,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-10 03:28:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:28:16,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:28:16,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 03:28:16,282 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:28:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 3 times [2018-11-10 03:28:16,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:28:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:28:16,406 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-10 03:28:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:16,614 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-10 03:28:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:28:16,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 69 transitions. [2018-11-10 03:28:16,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:16,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 69 transitions. [2018-11-10 03:28:16,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 03:28:16,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 03:28:16,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 69 transitions. [2018-11-10 03:28:16,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:28:16,617 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-10 03:28:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 69 transitions. [2018-11-10 03:28:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-11-10 03:28:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 03:28:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-10 03:28:16,620 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-10 03:28:16,620 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-10 03:28:16,620 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:28:16,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 59 transitions. [2018-11-10 03:28:16,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:28:16,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:28:16,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:28:16,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:16,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:28:16,622 INFO L793 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.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~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 800#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 837#L637-1 main_~length~0 := 0; 838#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 839#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 803#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 804#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 791#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 792#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 831#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 836#L630-4 havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 816#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 817#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 820#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 833#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.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~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 827#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 801#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 802#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 789#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 790#L630-1 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0; 794#L631 SUMMARY for call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L631 822#L631-1 SUMMARY for call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset + 4, 4); srcloc: L631-1 824#L631-2 append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 830#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 835#L630-4 havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 814#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 815#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 819#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 832#L639-4 assume main_~length~0 > 0; 812#L644 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644 813#L644-1 SUMMARY for call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset + 0, 4); srcloc: L644-1 818#L644-2 main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem11.base, main_#t~mem11.offset; 811#L645 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L645 784#L645-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 4, 4); srcloc: L645-1 785#L645-2 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset; 786#L646 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L646 840#L646-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 808#L647 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L647 809#L647-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 810#L650-2 [2018-11-10 03:28:16,622 INFO L795 eck$LassoCheckResult]: Loop: 810#L650-2 assume true; 797#L650 assume !!(main_~length~0 > 0); 798#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 826#L651-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L651-1 805#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 787#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 788#L652-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 793#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 821#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 810#L650-2 [2018-11-10 03:28:16,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1252954829, now seen corresponding path program 1 times [2018-11-10 03:28:16,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:28:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 4 times [2018-11-10 03:28:16,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash 31040525, now seen corresponding path program 1 times [2018-11-10 03:28:16,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:28:16,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:28:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:28:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:28:24,258 WARN L179 SmtUtils]: Spent 7.41 s on a formula simplification. DAG size of input: 420 DAG size of output: 345 [2018-11-10 03:28:25,631 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 167 [2018-11-10 03:28:25,633 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:28:25,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:28:25,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:28:25,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:28:25,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:28:25,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:28:25,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:28:25,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:28:25,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 03:28:25,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:28:25,634 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:28:25,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:25,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:28:26,168 FATAL L292 ToolchainWalker]: 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) 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:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 03:28:26,170 INFO L168 Benchmark]: Toolchain (without parser) took 13552.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -54.1 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:26,170 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:28:26,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 935.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:26,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:26,171 INFO L168 Benchmark]: Boogie Preprocessor took 16.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:26,172 INFO L168 Benchmark]: RCFGBuilder took 250.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:26,172 INFO L168 Benchmark]: BuchiAutomizer took 12924.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.8 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:26,174 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 935.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12924.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.8 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...