./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/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_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/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_612cc26b-5b27-48cb-b544-e1860fdd3a98/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-5842f4b [2018-11-18 10:30:57,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:30:57,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:30:57,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:30:57,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:30:57,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:30:57,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:30:57,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:30:57,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:30:57,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:30:57,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:30:57,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:30:57,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:30:57,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:30:57,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:30:57,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:30:57,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:30:57,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:30:57,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:30:57,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:30:57,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:30:57,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:30:57,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:30:57,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:30:57,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:30:57,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:30:57,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:30:57,752 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:30:57,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:30:57,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:30:57,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:30:57,754 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:30:57,754 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:30:57,754 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:30:57,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:30:57,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:30:57,756 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:30:57,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:30:57,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:30:57,768 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:30:57,768 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:30:57,768 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:30:57,768 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:30:57,768 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:30:57,768 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:30:57,769 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:30:57,769 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:30:57,769 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:30:57,769 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:30:57,769 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:30:57,769 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:30:57,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:30:57,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:30:57,771 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:30:57,771 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:30:57,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:30:57,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:30:57,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:30:57,772 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:30:57,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:30:57,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:30:57,772 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:30:57,773 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:30:57,773 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_612cc26b-5b27-48cb-b544-e1860fdd3a98/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-18 10:30:57,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:30:57,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:30:57,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:30:57,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:30:57,808 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:30:57,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-11-18 10:30:57,847 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/data/a339ed72c/24733d22cdeb40de9b94fb177a02fa74/FLAG99ead5e6d [2018-11-18 10:30:58,271 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:30:58,272 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-11-18 10:30:58,279 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/data/a339ed72c/24733d22cdeb40de9b94fb177a02fa74/FLAG99ead5e6d [2018-11-18 10:30:58,288 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/bin-2019/uautomizer/data/a339ed72c/24733d22cdeb40de9b94fb177a02fa74 [2018-11-18 10:30:58,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:30:58,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:30:58,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:30:58,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:30:58,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:30:58,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab0bb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58, skipping insertion in model container [2018-11-18 10:30:58,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:30:58,331 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:30:58,514 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:30:58,520 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:30:58,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:30:58,618 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:30:58,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58 WrapperNode [2018-11-18 10:30:58,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:30:58,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:30:58,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:30:58,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:30:58,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:30:58,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:30:58,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:30:58,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:30:58,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... [2018-11-18 10:30:58,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:30:58,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:30:58,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:30:58,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:30:58,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/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-18 10:30:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:30:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 10:30:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 10:30:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:30:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:30:58,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:30:58,920 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:30:58,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:30:58 BoogieIcfgContainer [2018-11-18 10:30:58,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:30:58,921 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:30:58,922 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:30:58,924 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:30:58,925 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:30:58,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:30:58" (1/3) ... [2018-11-18 10:30:58,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62895a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:30:58, skipping insertion in model container [2018-11-18 10:30:58,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:30:58,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:30:58" (2/3) ... [2018-11-18 10:30:58,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62895a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:30:58, skipping insertion in model container [2018-11-18 10:30:58,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:30:58,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:30:58" (3/3) ... [2018-11-18 10:30:58,928 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-11-18 10:30:58,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:30:58,963 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:30:58,963 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:30:58,963 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:30:58,963 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:30:58,963 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:30:58,963 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:30:58,963 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:30:58,964 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:30:58,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 10:30:58,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 10:30:58,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:30:58,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:30:58,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:30:58,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:30:58,996 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:30:58,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 10:30:58,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 10:30:58,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:30:58,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:30:58,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:30:58,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:30:59,002 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 5#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 11#L639-3true [2018-11-18 10:30:59,003 INFO L796 eck$LassoCheckResult]: Loop: 11#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L630true assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 6#L630-2true call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 13#L625true assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 7#L639-1true assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 11#L639-3true [2018-11-18 10:30:59,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:30:59,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:59,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:30:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:30:59,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2018-11-18 10:30:59,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:59,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:59,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:30:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:30:59,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2018-11-18 10:30:59,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:30:59,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:30:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:59,231 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-18 10:30:59,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:30:59,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:30:59,694 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2018-11-18 10:31:00,024 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 10:31:00,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:31:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:31:00,038 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 4 states. [2018-11-18 10:31:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:00,085 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-18 10:31:00,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:31:00,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-18 10:31:00,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 10:31:00,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 17 transitions. [2018-11-18 10:31:00,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 10:31:00,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 10:31:00,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-18 10:31:00,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:31:00,092 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 10:31:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-18 10:31:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-18 10:31:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 10:31:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-18 10:31:00,110 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 10:31:00,110 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 10:31:00,110 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:31:00,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-18 10:31:00,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 10:31:00,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:31:00,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:31:00,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:31:00,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:31:00,112 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 48#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 49#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 57#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 46#L630-2 [2018-11-18 10:31:00,112 INFO L796 eck$LassoCheckResult]: Loop: 46#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 47#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 50#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 52#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 56#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 46#L630-2 [2018-11-18 10:31:00,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-11-18 10:31:00,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:00,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:00,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2018-11-18 10:31:00,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:00,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:00,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:00,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:00,163 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2018-11-18 10:31:00,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:00,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:00,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:31:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:00,646 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2018-11-18 10:31:01,238 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-18 10:31:01,453 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2018-11-18 10:31:01,536 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:31:01,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:31:01,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:31:01,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:31:01,537 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:31:01,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:31:01,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:31:01,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:31:01,537 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 10:31:01,537 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:31:01,537 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:31:01,557 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-18 10:31:01,562 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-18 10:31:01,563 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-18 10:31:01,564 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-18 10:31:01,565 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-18 10:31:01,566 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-18 10:31:01,567 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-18 10:31:01,568 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-18 10:31:01,839 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-18 10:31:02,575 WARN L180 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2018-11-18 10:31:02,575 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-18 10:31:02,576 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-18 10:31:02,577 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-18 10:31:02,578 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-18 10:31:02,579 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-18 10:31:02,580 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-18 10:31:02,581 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-18 10:31:02,582 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-18 10:31:02,586 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-18 10:31:02,587 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-18 10:31:02,589 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-18 10:31:02,590 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-18 10:31:02,591 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-18 10:31:02,592 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-18 10:31:02,594 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-18 10:31:02,595 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-18 10:31:02,596 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-18 10:31:02,597 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-18 10:31:02,597 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-18 10:31:02,598 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-18 10:31:02,599 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-18 10:31:02,600 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-18 10:31:02,601 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-18 10:31:02,601 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-18 10:31:02,602 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-18 10:31:02,822 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-18 10:31:03,045 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-18 10:31:04,917 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2018-11-18 10:31:05,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:31:05,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:31:05,012 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-18 10:31:05,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:05,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:05,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,026 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-18 10:31:05,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:05,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:05,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,030 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-18 10:31:05,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:05,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:05,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:05,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,031 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-18 10:31:05,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:05,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:05,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:05,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,033 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-18 10:31:05,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:05,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:05,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:05,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,035 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-18 10:31:05,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:05,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:05,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:05,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,037 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-18 10:31:05,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:05,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:05,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:05,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:05,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:05,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:05,038 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-18 10:31:05,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:05,038 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:31:05,038 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-18 10:31:05,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:05,351 INFO L402 nArgumentSynthesizer]: We have 176 Motzkin's Theorem applications. [2018-11-18 10:31:05,351 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-18 10:31:06,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,630 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-18 10:31:06,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,638 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-18 10:31:06,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,640 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-18 10:31:06,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,642 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-18 10:31:06,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,645 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-18 10:31:06,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,648 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-18 10:31:06,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,648 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:31:06,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,651 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:31:06,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,654 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-18 10:31:06,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,658 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-18 10:31:06,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,660 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-18 10:31:06,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,663 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-18 10:31:06,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,666 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-18 10:31:06,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,667 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:31:06,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,667 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:31:06,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,673 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-18 10:31:06,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,674 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-18 10:31:06,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,676 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-18 10:31:06,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,681 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-18 10:31:06,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,683 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-18 10:31:06,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,687 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-18 10:31:06,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,689 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-18 10:31:06,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:31:06,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:31:06,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:31:06,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:31:06,691 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-18 10:31:06,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:31:06,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:31:06,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:31:06,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:31:06,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:31:06,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:31:06,696 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:31:06,703 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 10:31:06,703 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:31:06,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:31:06,706 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:31:06,706 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:31:06,706 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2018-11-18 10:31:06,743 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 10:31:06,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:06,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:31:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:06,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:31:06,816 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-18 10:31:06,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:31:06,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 10:31:06,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 21 states and 28 transitions. Complement of second has 6 states. [2018-11-18 10:31:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:31:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:31:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 10:31:06,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-18 10:31:06,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:31:06,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 10:31:06,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:31:06,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 10:31:06,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:31:06,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-18 10:31:06,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:06,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 22 transitions. [2018-11-18 10:31:06,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 10:31:06,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 10:31:06,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-18 10:31:06,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:31:06,855 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 10:31:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-18 10:31:06,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-18 10:31:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 10:31:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-18 10:31:06,856 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 10:31:06,856 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 10:31:06,857 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:31:06,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-18 10:31:06,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:06,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:31:06,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:31:06,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:31:06,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 10:31:06,858 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 158#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 159#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 171#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 173#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 161#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 164#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 165#L639-4 assume !(main_~length~0 > 0); 169#L650-2 [2018-11-18 10:31:06,858 INFO L796 eck$LassoCheckResult]: Loop: 169#L650-2 assume true; 170#L650 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 169#L650-2 [2018-11-18 10:31:06,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2018-11-18 10:31:06,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:06,889 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-18 10:31:06,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:31:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:31:06,890 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:31:06,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:06,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2023, now seen corresponding path program 1 times [2018-11-18 10:31:06,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:06,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:06,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:06,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:06,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:31:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:31:06,963 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 10:31:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:06,974 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-18 10:31:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:31:06,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2018-11-18 10:31:06,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:06,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2018-11-18 10:31:06,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 10:31:06,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 10:31:06,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-11-18 10:31:06,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:31:06,976 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 10:31:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-11-18 10:31:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-18 10:31:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 10:31:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-18 10:31:06,978 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 10:31:06,978 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 10:31:06,978 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:31:06,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-18 10:31:06,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:06,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:31:06,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:31:06,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:31:06,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 10:31:06,979 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 203#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 204#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 212#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 214#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 200#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 205#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 206#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 210#L650-2 [2018-11-18 10:31:06,979 INFO L796 eck$LassoCheckResult]: Loop: 210#L650-2 assume true; 211#L650 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 210#L650-2 [2018-11-18 10:31:06,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2018-11-18 10:31:06,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:06,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:06,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:06,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:06,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2023, now seen corresponding path program 2 times [2018-11-18 10:31:07,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:07,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702152, now seen corresponding path program 1 times [2018-11-18 10:31:07,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:31:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:07,030 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-18 10:31:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:31:07,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:31:07,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:31:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:31:07,107 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 10:31:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:07,122 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-18 10:31:07,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:31:07,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2018-11-18 10:31:07,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:07,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 30 transitions. [2018-11-18 10:31:07,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 10:31:07,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 10:31:07,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-18 10:31:07,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:31:07,125 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 10:31:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-18 10:31:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-11-18 10:31:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 10:31:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-18 10:31:07,127 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 10:31:07,127 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 10:31:07,127 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:31:07,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-18 10:31:07,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:07,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:31:07,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:31:07,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 10:31:07,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 10:31:07,128 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 254#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 255#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 266#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 256#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 257#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 261#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 262#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 267#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 269#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 268#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 259#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 260#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 264#L650-2 [2018-11-18 10:31:07,128 INFO L796 eck$LassoCheckResult]: Loop: 264#L650-2 assume true; 265#L650 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 264#L650-2 [2018-11-18 10:31:07,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2018-11-18 10:31:07,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:07,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:31:07,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:31:07,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_612cc26b-5b27-48cb-b544-e1860fdd3a98/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-18 10:31:07,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:07,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:31:07,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-18 10:31:07,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 10:31:07,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:31:07,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-18 10:31:07,297 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-18 10:31:07,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 10:31:07,316 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 18 treesize of output 17 [2018-11-18 10:31:07,317 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:31:07,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:31:07,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:31:07,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:31:07,346 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-11-18 10:31:07,363 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-18 10:31:07,365 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-18 10:31:07,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:31:07,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:31:07,368 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-18 10:31:07,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 10:31:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:31:07,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:31:07,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-18 10:31:07,386 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:31:07,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2023, now seen corresponding path program 3 times [2018-11-18 10:31:07,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:07,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:31:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:31:07,476 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-18 10:31:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:07,553 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-18 10:31:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:31:07,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-18 10:31:07,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:07,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 10:31:07,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 10:31:07,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 10:31:07,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2018-11-18 10:31:07,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:31:07,555 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 10:31:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2018-11-18 10:31:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 10:31:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 10:31:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 10:31:07,556 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 10:31:07,556 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 10:31:07,556 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:31:07,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2018-11-18 10:31:07,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 10:31:07,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:31:07,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:31:07,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:31:07,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 10:31:07,558 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 341#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 342#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 350#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 352#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 340#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 345#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 346#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 351#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 337#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 338#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 343#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 344#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 348#L650-2 [2018-11-18 10:31:07,558 INFO L796 eck$LassoCheckResult]: Loop: 348#L650-2 assume true; 349#L650 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 348#L650-2 [2018-11-18 10:31:07,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2018-11-18 10:31:07,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:31:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2023, now seen corresponding path program 4 times [2018-11-18 10:31:07,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash -51113314, now seen corresponding path program 1 times [2018-11-18 10:31:07,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:31:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:31:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:31:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:31:12,520 WARN L180 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 323 DAG size of output: 253 [2018-11-18 10:31:13,706 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 155 [2018-11-18 10:31:13,708 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:31:13,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:31:13,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:31:13,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:31:13,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:31:13,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:31:13,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:31:13,709 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:31:13,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 10:31:13,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:31:13,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:31:13,713 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-18 10:31:13,715 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-18 10:31:13,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-18 10:31:13,717 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-18 10:31:13,721 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-18 10:31:13,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-18 10:31:13,723 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-18 10:31:13,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:31:13,725 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-18 10:31:13,726 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-18 10:31:13,727 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-18 10:31:13,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:31:13,729 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-18 10:31:13,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-18 10:31:13,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-18 10:31:13,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:31:13,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-18 10:31:13,733 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-18 10:31:13,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-18 10:31:13,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-18 10:31:13,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:31:13,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-18 10:31:14,130 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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java: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-18 10:31:14,132 INFO L168 Benchmark]: Toolchain (without parser) took 15841.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.7 MB). Free memory was 951.1 MB in the beginning and 1.0 GB in the end (delta: -77.7 MB). Peak memory consumption was 460.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:31:14,133 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:31:14,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:31:14,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.26 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-18 10:31:14,134 INFO L168 Benchmark]: Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:31:14,134 INFO L168 Benchmark]: RCFGBuilder took 254.39 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:31:14,134 INFO L168 Benchmark]: BuchiAutomizer took 15210.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.0 MB). Peak memory consumption was 467.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:31:14,137 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.26 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. * Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 254.39 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15210.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.0 MB). Peak memory consumption was 467.5 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...