./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/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-635dfa2 [2018-12-09 10:47:56,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:47:56,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:47:56,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:47:56,689 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:47:56,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:47:56,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:47:56,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:47:56,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:47:56,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:47:56,693 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:47:56,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:47:56,694 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:47:56,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:47:56,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:47:56,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:47:56,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:47:56,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:47:56,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:47:56,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:47:56,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:47:56,699 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:47:56,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:47:56,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:47:56,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:47:56,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:47:56,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:47:56,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:47:56,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:47:56,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:47:56,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:47:56,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:47:56,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:47:56,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:47:56,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:47:56,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:47:56,705 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 10:47:56,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:47:56,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:47:56,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:47:56,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:47:56,713 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:47:56,713 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:47:56,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:47:56,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:47:56,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:47:56,716 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:47:56,716 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:47:56,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:47:56,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:47:56,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:47:56,716 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:47:56,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:47:56,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:47:56,717 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:47:56,717 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:47:56,717 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_7efd83e3-80ac-45d3-a0f9-9306d24caca2/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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-12-09 10:47:56,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:47:56,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:47:56,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:47:56,748 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:47:56,748 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:47:56,749 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 10:47:56,786 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/data/8da5bab7c/201eaeff38f14337bfe4956e378affad/FLAG073fa0982 [2018-12-09 10:47:57,246 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:47:57,246 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 10:47:57,252 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/data/8da5bab7c/201eaeff38f14337bfe4956e378affad/FLAG073fa0982 [2018-12-09 10:47:57,260 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/bin-2019/uautomizer/data/8da5bab7c/201eaeff38f14337bfe4956e378affad [2018-12-09 10:47:57,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:47:57,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:47:57,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:47:57,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:47:57,265 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:47:57,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57, skipping insertion in model container [2018-12-09 10:47:57,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:47:57,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:47:57,429 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:47:57,434 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:47:57,487 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:47:57,507 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:47:57,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57 WrapperNode [2018-12-09 10:47:57,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:47:57,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:47:57,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:47:57,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:47:57,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:47:57,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:47:57,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:47:57,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:47:57,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... [2018-12-09 10:47:57,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:47:57,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:47:57,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:47:57,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:47:57,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/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-12-09 10:47:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:47:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 10:47:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 10:47:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:47:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 10:47:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:47:57,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:47:57,733 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:47:57,733 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:47:57,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:57 BoogieIcfgContainer [2018-12-09 10:47:57,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:47:57,734 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:47:57,734 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:47:57,736 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:47:57,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:57,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:47:57" (1/3) ... [2018-12-09 10:47:57,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aa679c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:47:57, skipping insertion in model container [2018-12-09 10:47:57,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:57,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:47:57" (2/3) ... [2018-12-09 10:47:57,738 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aa679c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:47:57, skipping insertion in model container [2018-12-09 10:47:57,738 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:47:57,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:47:57" (3/3) ... [2018-12-09 10:47:57,739 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 10:47:57,773 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:47:57,774 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:47:57,774 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:47:57,774 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:47:57,774 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:47:57,774 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:47:57,775 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:47:57,775 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:47:57,775 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:47:57,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 10:47:57,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 10:47:57,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:57,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:57,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:47:57,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:47:57,806 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:47:57,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 10:47:57,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 10:47:57,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:57,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:57,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:47:57,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:47:57,815 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 8#L-1true 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~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 13#L639-3true [2018-12-09 10:47:57,815 INFO L796 eck$LassoCheckResult]: Loop: 13#L639-3true 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); 5#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; 9#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L625true main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 10#L639-1true assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 13#L639-3true [2018-12-09 10:47:57,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 10:47:57,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:57,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:57,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:57,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:57,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2018-12-09 10:47:57,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:57,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:57,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2018-12-09 10:47:57,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:57,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:57,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:47:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:47:57,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:47:57,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:47:58,392 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2018-12-09 10:47:58,701 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 10:47:58,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:47:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:47:58,712 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2018-12-09 10:47:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:47:58,746 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-09 10:47:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:47:58,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-12-09 10:47:58,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 10:47:58,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2018-12-09 10:47:58,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 10:47:58,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 10:47:58,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-09 10:47:58,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:47:58,752 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 10:47:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-09 10:47:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-09 10:47:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 10:47:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-09 10:47:58,769 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 10:47:58,769 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 10:47:58,769 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:47:58,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-09 10:47:58,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 10:47:58,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:47:58,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:47:58,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 10:47:58,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:47:58,770 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 52#L-1 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~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 53#L639-3 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); 60#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; 48#L630-2 [2018-12-09 10:47:58,770 INFO L796 eck$LassoCheckResult]: Loop: 48#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 49#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 54#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 56#L639-3 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); 59#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; 48#L630-2 [2018-12-09 10:47:58,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-12-09 10:47:58,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:58,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:58,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:58,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2018-12-09 10:47:58,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:47:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:58,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:47:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2018-12-09 10:47:58,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:47:58,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:47:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:58,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:47:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:47:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:47:59,303 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2018-12-09 10:47:59,922 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-12-09 10:48:00,104 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-12-09 10:48:00,176 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:48:00,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:48:00,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:48:00,177 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:48:00,177 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:48:00,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:48:00,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:48:00,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:48:00,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-12-09 10:48:00,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:48:00,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:48:00,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:00,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,156 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-12-09 10:48:01,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:01,393 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-09 10:48:01,583 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 10:48:03,357 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-12-09 10:48:03,411 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:48:03,414 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:48:03,415 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-12-09 10:48:03,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:03,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:03,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,431 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-12-09 10:48:03,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:03,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:03,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,435 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-12-09 10:48:03,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,438 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-12-09 10:48:03,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,440 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-12-09 10:48:03,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,442 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-12-09 10:48:03,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,444 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-12-09 10:48:03,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,446 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-12-09 10:48:03,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,448 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-12-09 10:48:03,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,450 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-12-09 10:48:03,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,452 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-12-09 10:48:03,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,454 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-12-09 10:48:03,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,456 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-12-09 10:48:03,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,458 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-12-09 10:48:03,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:48:03,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:48:03,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:48:03,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:48:03,461 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-12-09 10:48:03,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:48:03,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:48:03,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:48:03,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:48:03,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:48:03,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:48:03,471 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:48:03,479 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 10:48:03,479 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 10:48:03,481 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:48:03,481 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:48:03,482 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:48:03,482 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2018-12-09 10:48:03,501 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-09 10:48:03,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:03,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:03,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:03,560 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-12-09 10:48:03,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-09 10:48:03,582 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2018-12-09 10:48:03,582 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-12-09 10:48:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:48:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 10:48:03,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2018-12-09 10:48:03,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:03,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2018-12-09 10:48:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:03,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2018-12-09 10:48:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:48:03,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-12-09 10:48:03,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:03,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2018-12-09 10:48:03,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 10:48:03,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 10:48:03,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-12-09 10:48:03,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:03,587 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-09 10:48:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-12-09 10:48:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-09 10:48:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:48:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-09 10:48:03,588 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 10:48:03,588 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 10:48:03,588 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:48:03,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-09 10:48:03,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:03,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:03,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:03,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:03,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 10:48:03,589 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 167#L-1 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~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 168#L639-3 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); 177#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; 179#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 164#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 171#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 172#L639-4 assume !(main_~length~0 > 0); 176#L652-1 [2018-12-09 10:48:03,589 INFO L796 eck$LassoCheckResult]: Loop: 176#L652-1 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; 176#L652-1 [2018-12-09 10:48:03,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2018-12-09 10:48:03,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:03,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:03,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:48:03,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:48:03,613 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:03,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2018-12-09 10:48:03,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:48:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:48:03,688 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 10:48:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:03,700 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-09 10:48:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:48:03,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-12-09 10:48:03,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:03,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2018-12-09 10:48:03,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 10:48:03,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 10:48:03,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-12-09 10:48:03,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:03,702 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-09 10:48:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-12-09 10:48:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-09 10:48:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:48:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-09 10:48:03,703 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-09 10:48:03,704 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-09 10:48:03,704 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:48:03,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-09 10:48:03,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:03,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:03,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:03,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:03,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 10:48:03,705 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 212#L-1 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~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 213#L639-3 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); 220#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; 222#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 209#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 214#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 215#L639-4 assume main_~length~0 > 0; 206#L644 assume !(main_~length~0 < 0); 207#L644-2 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, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.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; 219#L652-1 [2018-12-09 10:48:03,705 INFO L796 eck$LassoCheckResult]: Loop: 219#L652-1 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; 219#L652-1 [2018-12-09 10:48:03,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2018-12-09 10:48:03,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:03,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2018-12-09 10:48:03,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:03,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2018-12-09 10:48:03,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:03,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:48:03,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:48:03,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:48:03,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:48:03,816 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-09 10:48:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:03,829 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-12-09 10:48:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:48:03,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2018-12-09 10:48:03,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:03,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2018-12-09 10:48:03,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 10:48:03,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 10:48:03,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2018-12-09 10:48:03,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:03,831 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-09 10:48:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2018-12-09 10:48:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-09 10:48:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:48:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-09 10:48:03,832 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 10:48:03,832 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 10:48:03,832 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:48:03,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-09 10:48:03,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:03,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:03,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:03,832 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:03,832 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 10:48:03,833 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 269#L-1 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~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 270#L639-3 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); 277#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; 266#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 267#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 273#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 274#L639-3 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); 278#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; 280#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 279#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 271#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 272#L639-4 assume main_~length~0 > 0; 264#L644 assume !(main_~length~0 < 0); 265#L644-2 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, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.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; 276#L652-1 [2018-12-09 10:48:03,833 INFO L796 eck$LassoCheckResult]: Loop: 276#L652-1 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; 276#L652-1 [2018-12-09 10:48:03,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2018-12-09 10:48:03,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:03,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:48:03,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7efd83e3-80ac-45d3-a0f9-9306d24caca2/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-12-09 10:48:03,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:48:03,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:48:03,936 INFO L478 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-12-09 10:48:03,938 INFO L478 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-12-09 10:48:03,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:03,957 INFO L478 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-12-09 10:48:03,966 INFO L478 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-12-09 10:48:03,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 10:48:03,981 INFO L478 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-12-09 10:48:03,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:03,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:48:03,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:48:04,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:48:04,008 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-12-09 10:48:04,021 INFO L478 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-12-09 10:48:04,022 INFO L478 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-12-09 10:48:04,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:48:04,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-09 10:48:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:48:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:48:04,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-12-09 10:48:04,041 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:48:04,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2018-12-09 10:48:04,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:48:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:48:04,102 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-09 10:48:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:48:04,135 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-09 10:48:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:48:04,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-12-09 10:48:04,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:04,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-12-09 10:48:04,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 10:48:04,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 10:48:04,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-12-09 10:48:04,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:48:04,137 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-09 10:48:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-12-09 10:48:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 10:48:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:48:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-09 10:48:04,138 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-09 10:48:04,138 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-09 10:48:04,138 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:48:04,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-12-09 10:48:04,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 10:48:04,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:48:04,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:48:04,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:48:04,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 10:48:04,140 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 357#L-1 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~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 358#L639-3 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); 368#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; 359#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 360#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 364#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 365#L639-3 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); 369#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; 371#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~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 370#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 362#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 363#L639-4 assume main_~length~0 > 0; 355#L644 assume !(main_~length~0 < 0); 356#L644-2 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, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.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; 367#L652-1 [2018-12-09 10:48:04,140 INFO L796 eck$LassoCheckResult]: Loop: 367#L652-1 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; 367#L652-1 [2018-12-09 10:48:04,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2018-12-09 10:48:04,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:04,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:04,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2018-12-09 10:48:04,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:48:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:48:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2018-12-09 10:48:04,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:48:04,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:48:04,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:48:04,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:48:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:48:07,905 WARN L180 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 310 DAG size of output: 243 [2018-12-09 10:48:08,487 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-12-09 10:48:08,489 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:48:08,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:48:08,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:48:08,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:48:08,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:48:08,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:48:08,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:48:08,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:48:08,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration6_Lasso [2018-12-09 10:48:08,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:48:08,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:48:08,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:08,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:08,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:08,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:08,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:48:08,734 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-12-09 10:48:08,735 INFO L168 Benchmark]: Toolchain (without parser) took 11473.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 957.1 MB in the beginning and 913.8 MB in the end (delta: 43.3 MB). Peak memory consumption was 344.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:48:08,736 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:48:08,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 10:48:08,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:48:08,736 INFO L168 Benchmark]: Boogie Preprocessor took 15.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:48:08,736 INFO L168 Benchmark]: RCFGBuilder took 183.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:48:08,737 INFO L168 Benchmark]: BuchiAutomizer took 11001.06 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 1.0 GB in the beginning and 913.8 MB in the end (delta: 114.1 MB). Peak memory consumption was 343.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:48:08,738 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 183.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11001.06 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 1.0 GB in the beginning and 913.8 MB in the end (delta: 114.1 MB). Peak memory consumption was 343.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...