./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_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_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/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 5f5357e64289d6bac41f74df7b40a85eebbaa806 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 20:39:08,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:39:08,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:39:08,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:39:08,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:39:08,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:39:08,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:39:08,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:39:08,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:39:08,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:39:08,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:39:08,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:39:08,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:39:08,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:39:08,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:39:08,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:39:08,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:39:08,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:39:08,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:39:08,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:39:08,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:39:08,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:39:08,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:39:08,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:39:08,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:39:08,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:39:08,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:39:08,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:39:08,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:39:08,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:39:08,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:39:08,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:39:08,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:39:08,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:39:08,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:39:08,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:39:08,425 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 20:39:08,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:39:08,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:39:08,435 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:39:08,435 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:39:08,436 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 20:39:08,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:39:08,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 20:39:08,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:39:08,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 20:39:08,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:39:08,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:39:08,438 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 20:39:08,438 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 20:39:08,438 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_a5c6e699-23a8-48a6-8e72-41337ad64347/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 -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2018-12-08 20:39:08,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:39:08,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:39:08,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:39:08,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:39:08,465 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:39:08,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-12-08 20:39:08,499 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/data/cd4e5d17a/084f850bdc954a5d8da2dcbb804bcf86/FLAGa435c3194 [2018-12-08 20:39:08,888 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:39:08,888 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-12-08 20:39:08,892 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/data/cd4e5d17a/084f850bdc954a5d8da2dcbb804bcf86/FLAGa435c3194 [2018-12-08 20:39:09,235 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/data/cd4e5d17a/084f850bdc954a5d8da2dcbb804bcf86 [2018-12-08 20:39:09,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:39:09,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:39:09,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:39:09,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:39:09,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:39:09,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509d5fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09, skipping insertion in model container [2018-12-08 20:39:09,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:39:09,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:39:09,359 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:39:09,365 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:39:09,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:39:09,391 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:39:09,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09 WrapperNode [2018-12-08 20:39:09,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:39:09,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:39:09,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:39:09,392 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:39:09,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:39:09,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:39:09,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:39:09,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:39:09,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... [2018-12-08 20:39:09,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:39:09,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:39:09,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:39:09,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:39:09,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/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-08 20:39:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 20:39:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:39:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:39:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-12-08 20:39:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:39:09,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:39:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 20:39:09,665 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:39:09,665 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-08 20:39:09,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:39:09 BoogieIcfgContainer [2018-12-08 20:39:09,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:39:09,665 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 20:39:09,666 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 20:39:09,668 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 20:39:09,669 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:39:09,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:39:09" (1/3) ... [2018-12-08 20:39:09,669 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f4b9160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:39:09, skipping insertion in model container [2018-12-08 20:39:09,669 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:39:09,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:39:09" (2/3) ... [2018-12-08 20:39:09,670 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f4b9160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:39:09, skipping insertion in model container [2018-12-08 20:39:09,670 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:39:09,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:39:09" (3/3) ... [2018-12-08 20:39:09,671 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-12-08 20:39:09,702 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:39:09,702 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 20:39:09,702 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 20:39:09,702 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 20:39:09,702 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:39:09,702 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:39:09,702 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 20:39:09,702 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:39:09,702 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 20:39:09,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-12-08 20:39:09,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-08 20:39:09,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:09,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:09,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 20:39:09,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:39:09,727 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 20:39:09,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-12-08 20:39:09,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-08 20:39:09,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:09,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:09,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 20:39:09,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:39:09,733 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 25#L50true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L51-4true [2018-12-08 20:39:09,733 INFO L796 eck$LassoCheckResult]: Loop: 3#L51-4true parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 11#L54true assume !parse_expression_list_#t~switch4; 29#L53true havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 8#L51-1true call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L51-2true assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3#L51-4true [2018-12-08 20:39:09,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 20:39:09,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:09,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:09,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:09,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:09,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2018-12-08 20:39:09,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:09,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:09,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:09,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:09,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:09,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:09,823 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2018-12-08 20:39:09,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:09,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:09,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:09,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:09,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,047 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:39:10,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:39:10,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:39:10,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:39:10,048 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:39:10,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:39:10,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:39:10,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:39:10,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-08 20:39:10,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:39:10,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:39:10,065 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-08 20:39:10,070 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-08 20:39:10,071 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-08 20:39:10,073 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-08 20:39:10,074 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-08 20:39:10,075 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-08 20:39:10,077 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-08 20:39:10,078 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-08 20:39:10,079 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-08 20:39:10,084 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-08 20:39:10,085 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-08 20:39:10,087 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-08 20:39:10,088 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-08 20:39:10,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-08 20:39:10,170 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-08 20:39:10,171 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-08 20:39:10,172 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-08 20:39:10,173 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-08 20:39:10,173 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-08 20:39:10,174 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-08 20:39:10,175 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-08 20:39:10,176 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-08 20:39:10,177 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-08 20:39:10,178 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-08 20:39:10,179 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-08 20:39:10,180 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-08 20:39:10,181 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-08 20:39:10,182 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-08 20:39:10,183 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-08 20:39:10,359 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:39:10,362 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:39:10,363 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-08 20:39:10,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,368 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-08 20:39:10,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,370 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-08 20:39:10,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,374 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-08 20:39:10,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,376 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-08 20:39:10,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,378 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-08 20:39:10,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,385 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-08 20:39:10,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,388 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-08 20:39:10,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,391 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-08 20:39:10,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,396 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-08 20:39:10,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,399 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-08 20:39:10,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,403 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-08 20:39:10,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:10,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,405 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-08 20:39:10,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,409 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-08 20:39:10,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,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-08 20:39:10,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:10,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 20:39:10,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,416 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 20:39:10,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:10,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,419 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-08 20:39:10,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,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-08 20:39:10,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,434 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-08 20:39:10,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,435 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:39:10,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,436 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:39:10,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,445 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-08 20:39:10,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:10,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-08 20:39:10,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:10,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:10,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:10,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:10,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:10,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:10,474 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:39:10,489 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 20:39:10,489 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 20:39:10,490 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:39:10,491 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:39:10,491 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:39:10,492 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-12-08 20:39:10,504 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-12-08 20:39:10,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 20:39:10,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:10,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:10,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:10,580 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-08 20:39:10,590 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 20:39:10,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 4 states. [2018-12-08 20:39:10,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 4 states. Result 96 states and 135 transitions. Complement of second has 7 states. [2018-12-08 20:39:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 20:39:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 20:39:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-12-08 20:39:10,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 5 letters. [2018-12-08 20:39:10,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:10,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 20:39:10,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:10,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-08 20:39:10,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:10,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 135 transitions. [2018-12-08 20:39:10,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:10,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 40 states and 55 transitions. [2018-12-08 20:39:10,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 20:39:10,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 20:39:10,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2018-12-08 20:39:10,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:10,669 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2018-12-08 20:39:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2018-12-08 20:39:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-08 20:39:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 20:39:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2018-12-08 20:39:10,686 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-12-08 20:39:10,686 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-12-08 20:39:10,686 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 20:39:10,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2018-12-08 20:39:10,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:10,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:10,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:10,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 20:39:10,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:10,687 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 226#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 227#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 209#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 210#L54 assume parse_expression_list_#t~switch4; 220#L55-5 [2018-12-08 20:39:10,687 INFO L796 eck$LassoCheckResult]: Loop: 220#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 221#L55-1 assume parse_expression_list_#t~short7; 224#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 220#L55-5 [2018-12-08 20:39:10,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2018-12-08 20:39:10,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:10,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2018-12-08 20:39:10,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:10,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2018-12-08 20:39:10,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:10,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:10,841 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-08 20:39:10,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:39:10,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:39:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:39:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:39:10,871 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-12-08 20:39:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:10,948 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2018-12-08 20:39:10,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:39:10,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2018-12-08 20:39:10,950 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-08 20:39:10,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2018-12-08 20:39:10,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 20:39:10,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 20:39:10,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2018-12-08 20:39:10,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:10,951 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2018-12-08 20:39:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2018-12-08 20:39:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-12-08 20:39:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-08 20:39:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2018-12-08 20:39:10,953 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-12-08 20:39:10,954 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-12-08 20:39:10,954 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 20:39:10,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2018-12-08 20:39:10,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:10,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:10,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:10,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:10,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:10,955 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 351#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 332#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 333#L54 assume !parse_expression_list_#t~switch4; 342#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 347#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 336#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 334#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 335#L54 assume parse_expression_list_#t~switch4; 343#L55-5 [2018-12-08 20:39:10,955 INFO L796 eck$LassoCheckResult]: Loop: 343#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 344#L55-1 assume parse_expression_list_#t~short7; 377#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 343#L55-5 [2018-12-08 20:39:10,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2018-12-08 20:39:10,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:10,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2018-12-08 20:39:10,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:10,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2018-12-08 20:39:10,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,169 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2018-12-08 20:39:11,221 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:39:11,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:39:11,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:39:11,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:39:11,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:39:11,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:39:11,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:39:11,221 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:39:11,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-12-08 20:39:11,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:39:11,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:39:11,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-08 20:39:11,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-08 20:39:11,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-08 20:39:11,227 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-08 20:39:11,228 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-08 20:39:11,229 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-08 20:39:11,230 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-08 20:39:11,319 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-08 20:39:11,320 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-08 20:39:11,322 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-08 20:39:11,323 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-08 20:39:11,324 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-08 20:39:11,325 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-08 20:39:11,326 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-08 20:39:11,327 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-08 20:39:11,328 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-08 20:39:11,329 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-08 20:39:11,334 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-08 20:39:11,335 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-08 20:39:11,336 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-08 20:39:11,337 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-08 20:39:11,338 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-08 20:39:11,340 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-08 20:39:11,341 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-08 20:39:11,342 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-08 20:39:11,343 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-08 20:39:11,344 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-08 20:39:11,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:39:11,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:39:11,502 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-08 20:39:11,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:11,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:11,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:11,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,503 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-08 20:39:11,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:11,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:11,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:11,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,505 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-08 20:39:11,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,507 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-08 20:39:11,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:11,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:11,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:11,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,508 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-08 20:39:11,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:11,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:11,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:11,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,509 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-08 20:39:11,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:11,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:11,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:11,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,510 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-08 20:39:11,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,512 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-08 20:39:11,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,515 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-08 20:39:11,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:39:11,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,515 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:39:11,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,517 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-08 20:39:11,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,521 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-08 20:39:11,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,523 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-08 20:39:11,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,523 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:39:11,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,524 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:39:11,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,527 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-08 20:39:11,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:11,529 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-08 20:39:11,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:11,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:11,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:11,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:11,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:11,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:11,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:39:11,542 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 20:39:11,543 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:39:11,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:39:11,543 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:39:11,544 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:39:11,544 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2, ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset Supporting invariants [] [2018-12-08 20:39:11,555 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 20:39:11,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 20:39:11,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:11,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:11,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:11,585 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-08 20:39:11,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 20:39:11,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-12-08 20:39:11,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 153 states and 213 transitions. Complement of second has 7 states. [2018-12-08 20:39:11,621 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-08 20:39:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:39:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-12-08 20:39:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 20:39:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-08 20:39:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-08 20:39:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:11,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2018-12-08 20:39:11,623 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-12-08 20:39:11,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2018-12-08 20:39:11,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-08 20:39:11,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-08 20:39:11,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2018-12-08 20:39:11,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:11,625 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2018-12-08 20:39:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2018-12-08 20:39:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2018-12-08 20:39:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-08 20:39:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-12-08 20:39:11,628 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-12-08 20:39:11,628 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-12-08 20:39:11,628 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 20:39:11,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2018-12-08 20:39:11,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:11,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:11,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:11,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:11,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:11,630 INFO L794 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 651#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 652#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 630#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 631#L54 assume parse_expression_list_#t~switch4; 658#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 676#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 648#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 636#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 637#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 660#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 661#L58-8 [2018-12-08 20:39:11,630 INFO L796 eck$LassoCheckResult]: Loop: 661#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 668#L58-1 assume !parse_expression_list_#t~short14; 654#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 661#L58-8 [2018-12-08 20:39:11,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2018-12-08 20:39:11,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2018-12-08 20:39:11,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:11,645 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-08 20:39:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:39:11,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 20:39:11,645 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 20:39:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:39:11,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:39:11,646 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-12-08 20:39:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:11,654 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2018-12-08 20:39:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:39:11,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2018-12-08 20:39:11,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:11,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2018-12-08 20:39:11,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 20:39:11,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 20:39:11,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2018-12-08 20:39:11,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:11,656 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2018-12-08 20:39:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2018-12-08 20:39:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-08 20:39:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-08 20:39:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2018-12-08 20:39:11,660 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2018-12-08 20:39:11,660 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2018-12-08 20:39:11,660 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 20:39:11,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2018-12-08 20:39:11,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:11,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:11,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:11,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:11,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:39:11,661 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 802#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 803#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 782#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 783#L54 assume parse_expression_list_#t~switch4; 794#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 795#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 835#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 832#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 815#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 806#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 807#L58-8 [2018-12-08 20:39:11,661 INFO L796 eck$LassoCheckResult]: Loop: 807#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 819#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 816#L58-2 assume parse_expression_list_#t~short13; 810#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 811#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 807#L58-8 [2018-12-08 20:39:11,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2018-12-08 20:39:11,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2018-12-08 20:39:11,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:11,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2018-12-08 20:39:11,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:11,710 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-08 20:39:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:39:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:39:11,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:39:11,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:39:11,769 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2018-12-08 20:39:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:11,822 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2018-12-08 20:39:11,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:39:11,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 161 transitions. [2018-12-08 20:39:11,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 20:39:11,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 111 states and 148 transitions. [2018-12-08 20:39:11,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-08 20:39:11,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-08 20:39:11,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 148 transitions. [2018-12-08 20:39:11,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:11,825 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 148 transitions. [2018-12-08 20:39:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 148 transitions. [2018-12-08 20:39:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2018-12-08 20:39:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 20:39:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2018-12-08 20:39:11,829 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2018-12-08 20:39:11,829 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2018-12-08 20:39:11,829 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 20:39:11,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2018-12-08 20:39:11,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:11,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:11,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:11,830 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:11,830 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:39:11,830 INFO L794 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1015#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1016#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 995#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 996#L54 assume !parse_expression_list_#t~switch4; 1018#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1071#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1070#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1064#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1017#L54 assume parse_expression_list_#t~switch4; 1019#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1009#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1069#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 1000#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1001#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1021#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1022#L58-8 [2018-12-08 20:39:11,831 INFO L796 eck$LassoCheckResult]: Loop: 1022#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1034#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1031#L58-2 assume parse_expression_list_#t~short13; 1025#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1026#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1022#L58-8 [2018-12-08 20:39:11,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash -960269922, now seen corresponding path program 1 times [2018-12-08 20:39:11,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2018-12-08 20:39:11,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:11,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash -554161477, now seen corresponding path program 1 times [2018-12-08 20:39:11,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:11,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:39:11,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:39:11,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/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-08 20:39:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:11,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:39:11,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:39:11,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 20:39:11,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:39:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:39:11,993 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. cyclomatic complexity: 33 Second operand 7 states. [2018-12-08 20:39:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:12,060 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2018-12-08 20:39:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:39:12,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 222 transitions. [2018-12-08 20:39:12,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-08 20:39:12,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 150 states and 200 transitions. [2018-12-08 20:39:12,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-08 20:39:12,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-08 20:39:12,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2018-12-08 20:39:12,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:12,063 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2018-12-08 20:39:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2018-12-08 20:39:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2018-12-08 20:39:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-08 20:39:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2018-12-08 20:39:12,068 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-12-08 20:39:12,068 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-12-08 20:39:12,068 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 20:39:12,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 156 transitions. [2018-12-08 20:39:12,069 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 20:39:12,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:12,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:12,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:12,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:39:12,070 INFO L794 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1340#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1341#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1319#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1320#L54 assume !parse_expression_list_#t~switch4; 1418#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1417#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1416#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1415#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1414#L54 assume !parse_expression_list_#t~switch4; 1378#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1427#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1382#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1381#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1377#L54 assume parse_expression_list_#t~switch4; 1330#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1331#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1364#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 1323#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1324#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1343#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1344#L58-8 [2018-12-08 20:39:12,070 INFO L796 eck$LassoCheckResult]: Loop: 1344#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1356#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1353#L58-2 assume parse_expression_list_#t~short13; 1347#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1348#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1344#L58-8 [2018-12-08 20:39:12,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:12,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 2 times [2018-12-08 20:39:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:12,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:12,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:12,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:12,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2018-12-08 20:39:12,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:12,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:12,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:12,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:12,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:12,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 2 times [2018-12-08 20:39:12,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:12,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:12,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:12,408 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 118 [2018-12-08 20:39:12,459 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:39:12,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:39:12,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:39:12,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:39:12,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:39:12,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:39:12,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:39:12,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:39:12,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-08 20:39:12,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:39:12,460 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:39:12,461 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-08 20:39:12,463 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-08 20:39:12,464 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-08 20:39:12,466 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-08 20:39:12,467 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-08 20:39:12,468 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-08 20:39:12,469 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-08 20:39:12,470 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-08 20:39:12,471 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-08 20:39:12,472 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-08 20:39:12,473 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-08 20:39:12,474 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-08 20:39:12,475 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-08 20:39:12,476 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-08 20:39:12,476 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-08 20:39:12,477 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-08 20:39:12,478 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-08 20:39:12,480 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-08 20:39:12,481 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-08 20:39:12,482 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-08 20:39:12,483 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-08 20:39:12,484 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-08 20:39:12,485 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-08 20:39:12,486 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-08 20:39:12,487 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-08 20:39:12,487 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-08 20:39:12,894 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:39:12,894 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:39:12,894 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-08 20:39:12,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,896 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-08 20:39:12,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,897 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-08 20:39:12,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,898 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-08 20:39:12,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,899 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-08 20:39:12,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,901 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-08 20:39:12,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,903 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-08 20:39:12,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,905 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-08 20:39:12,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,906 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-08 20:39:12,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,908 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-08 20:39:12,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,910 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-08 20:39:12,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,911 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-08 20:39:12,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,913 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-08 20:39:12,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,915 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-08 20:39:12,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,916 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-08 20:39:12,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,918 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-08 20:39:12,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,919 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-08 20:39:12,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,922 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-08 20:39:12,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,924 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-08 20:39:12,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,925 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-08 20:39:12,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,927 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-08 20:39:12,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,929 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-08 20:39:12,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,930 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-08 20:39:12,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,932 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-08 20:39:12,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,933 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-08 20:39:12,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:39:12,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:39:12,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:39:12,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,935 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-08 20:39:12,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,938 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-08 20:39:12,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,938 INFO L205 nArgumentSynthesizer]: 5 stem disjuncts [2018-12-08 20:39:12,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,939 INFO L402 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2018-12-08 20:39:12,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,944 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-08 20:39:12,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,946 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-08 20:39:12,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,947 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:39:12,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,948 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:39:12,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:39:12,951 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-08 20:39:12,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:39:12,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:39:12,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:39:12,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:39:12,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:39:12,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:39:12,961 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:39:12,971 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 20:39:12,972 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 20:39:12,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:39:12,973 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:39:12,973 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:39:12,973 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2018-12-08 20:39:13,006 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-12-08 20:39:13,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:13,055 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-08 20:39:13,055 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-08 20:39:13,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49 Second operand 4 states. [2018-12-08 20:39:13,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 271 states and 365 transitions. Complement of second has 11 states. [2018-12-08 20:39:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 20:39:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 20:39:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-12-08 20:39:13,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2018-12-08 20:39:13,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:13,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2018-12-08 20:39:13,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:13,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2018-12-08 20:39:13,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:39:13,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 365 transitions. [2018-12-08 20:39:13,125 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2018-12-08 20:39:13,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 174 states and 233 transitions. [2018-12-08 20:39:13,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 20:39:13,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 20:39:13,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 233 transitions. [2018-12-08 20:39:13,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:13,126 INFO L705 BuchiCegarLoop]: Abstraction has 174 states and 233 transitions. [2018-12-08 20:39:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 233 transitions. [2018-12-08 20:39:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2018-12-08 20:39:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 20:39:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2018-12-08 20:39:13,129 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2018-12-08 20:39:13,129 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2018-12-08 20:39:13,129 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 20:39:13,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 163 transitions. [2018-12-08 20:39:13,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 20:39:13,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:13,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:13,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:13,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:13,131 INFO L794 eck$LassoCheckResult]: Stem: 1924#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1900#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1901#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1880#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1881#L54 assume parse_expression_list_#t~switch4; 1982#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1987#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1985#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 1983#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1980#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1978#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1976#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1974#L58-1 assume !parse_expression_list_#t~short14; 1972#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 1969#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1968#L59 assume !parse_expression_list_#t~short17; 1966#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 1964#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 1962#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1959#L3 assume !(0 == __VERIFIER_assert_~cond); 1958#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 1955#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 1951#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1948#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1945#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1944#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1943#L54 assume parse_expression_list_#t~switch4; 1897#L55-5 [2018-12-08 20:39:13,131 INFO L796 eck$LassoCheckResult]: Loop: 1897#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1940#L55-1 assume parse_expression_list_#t~short7; 1896#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1897#L55-5 [2018-12-08 20:39:13,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1008934689, now seen corresponding path program 1 times [2018-12-08 20:39:13,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:39:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:39:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:39:13,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:39:13,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2018-12-08 20:39:13,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:13,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:39:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:39:13,186 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. cyclomatic complexity: 50 Second operand 7 states. [2018-12-08 20:39:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:13,293 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2018-12-08 20:39:13,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:39:13,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 282 transitions. [2018-12-08 20:39:13,294 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2018-12-08 20:39:13,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 175 states and 230 transitions. [2018-12-08 20:39:13,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-12-08 20:39:13,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-12-08 20:39:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 230 transitions. [2018-12-08 20:39:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:13,295 INFO L705 BuchiCegarLoop]: Abstraction has 175 states and 230 transitions. [2018-12-08 20:39:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 230 transitions. [2018-12-08 20:39:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2018-12-08 20:39:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-08 20:39:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2018-12-08 20:39:13,299 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2018-12-08 20:39:13,299 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2018-12-08 20:39:13,299 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 20:39:13,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 164 transitions. [2018-12-08 20:39:13,300 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 20:39:13,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:13,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:13,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:13,300 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:13,301 INFO L794 eck$LassoCheckResult]: Stem: 2280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2252#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2253#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2233#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2234#L54 assume parse_expression_list_#t~switch4; 2315#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2314#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2313#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 2312#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2311#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2310#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2309#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2308#L58-1 assume !parse_expression_list_#t~short14; 2307#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 2306#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2294#L59 assume !parse_expression_list_#t~short17; 2295#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 2305#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2303#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2301#L3 assume !(0 == __VERIFIER_assert_~cond); 2299#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2242#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2243#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2304#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2302#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2300#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2298#L54 assume parse_expression_list_#t~switch4; 2244#L55-5 [2018-12-08 20:39:13,301 INFO L796 eck$LassoCheckResult]: Loop: 2244#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2245#L55-1 assume parse_expression_list_#t~short7; 2250#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2244#L55-5 [2018-12-08 20:39:13,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2018-12-08 20:39:13,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:39:13,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:39:13,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:39:13,325 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:39:13,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2018-12-08 20:39:13,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:39:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:39:13,352 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. cyclomatic complexity: 48 Second operand 6 states. [2018-12-08 20:39:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:13,405 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2018-12-08 20:39:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:39:13,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 147 transitions. [2018-12-08 20:39:13,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:13,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 98 states and 132 transitions. [2018-12-08 20:39:13,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 20:39:13,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 20:39:13,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 132 transitions. [2018-12-08 20:39:13,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:13,407 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2018-12-08 20:39:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 132 transitions. [2018-12-08 20:39:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-08 20:39:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 20:39:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2018-12-08 20:39:13,409 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2018-12-08 20:39:13,409 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2018-12-08 20:39:13,409 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 20:39:13,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 132 transitions. [2018-12-08 20:39:13,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:13,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:13,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:13,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:13,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:13,411 INFO L794 eck$LassoCheckResult]: Stem: 2526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2502#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2503#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2483#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2484#L54 assume !parse_expression_list_#t~switch4; 2504#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2567#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2565#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2562#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2560#L54 assume parse_expression_list_#t~switch4; 2497#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2498#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2578#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 2579#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2580#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 2507#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2508#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2518#L58-1 assume !parse_expression_list_#t~short14; 2519#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 2532#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2531#L59 assume !parse_expression_list_#t~short17; 2529#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 2527#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2523#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2516#L3 assume !(0 == __VERIFIER_assert_~cond); 2513#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2492#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2493#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2577#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2576#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2574#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2572#L54 assume parse_expression_list_#t~switch4; 2495#L55-5 [2018-12-08 20:39:13,411 INFO L796 eck$LassoCheckResult]: Loop: 2495#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2496#L55-1 assume parse_expression_list_#t~short7; 2500#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2495#L55-5 [2018-12-08 20:39:13,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1171373033, now seen corresponding path program 1 times [2018-12-08 20:39:13,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:39:13,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:39:13,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:39:13,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:39:13,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2018-12-08 20:39:13,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:39:13,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:39:13,498 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. cyclomatic complexity: 41 Second operand 8 states. [2018-12-08 20:39:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:13,593 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2018-12-08 20:39:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:39:13,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 232 transitions. [2018-12-08 20:39:13,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-08 20:39:13,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 149 states and 201 transitions. [2018-12-08 20:39:13,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 20:39:13,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 20:39:13,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 201 transitions. [2018-12-08 20:39:13,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:39:13,594 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 201 transitions. [2018-12-08 20:39:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 201 transitions. [2018-12-08 20:39:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2018-12-08 20:39:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 20:39:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2018-12-08 20:39:13,596 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2018-12-08 20:39:13,596 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2018-12-08 20:39:13,596 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 20:39:13,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 158 transitions. [2018-12-08 20:39:13,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 20:39:13,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:39:13,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:39:13,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:39:13,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:39:13,598 INFO L794 eck$LassoCheckResult]: Stem: 2822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2795#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2796#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2774#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2775#L54 assume !parse_expression_list_#t~switch4; 2797#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2786#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2787#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2776#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2777#L54 assume parse_expression_list_#t~switch4; 2790#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2791#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2884#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 2883#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2807#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2800#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2801#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2818#L58-1 assume !parse_expression_list_#t~short14; 2837#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 2835#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2833#L59 assume !parse_expression_list_#t~short17; 2832#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 2824#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2819#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2811#L3 assume !(0 == __VERIFIER_assert_~cond); 2806#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2784#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2785#L53 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2830#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2829#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2828#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2825#L54 assume parse_expression_list_#t~switch4; 2788#L55-5 [2018-12-08 20:39:13,598 INFO L796 eck$LassoCheckResult]: Loop: 2788#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2789#L55-1 assume parse_expression_list_#t~short7; 2792#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2788#L55-5 [2018-12-08 20:39:13,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2018-12-08 20:39:13,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:39:13,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:39:13,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:39:13,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5c6e699-23a8-48a6-8e72-41337ad64347/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:39:13,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:39:13,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:39:13,712 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 5 treesize of output 1 [2018-12-08 20:39:13,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-08 20:39:13,798 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-08 20:39:13,800 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 14 treesize of output 13 [2018-12-08 20:39:13,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:39:13,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2018-12-08 20:39:13,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-08 20:39:13,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 1 [2018-12-08 20:39:13,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-12-08 20:39:13,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:39:13,847 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2018-12-08 20:39:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:39:13,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:39:13,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-08 20:39:13,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:39:13,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:39:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2018-12-08 20:39:13,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:39:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:39:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:39:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:39:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:39:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:39:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-08 20:39:13,895 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. cyclomatic complexity: 48 Second operand 16 states. [2018-12-08 20:39:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:39:14,230 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-12-08 20:39:14,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:39:14,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 97 transitions. [2018-12-08 20:39:14,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:39:14,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-12-08 20:39:14,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 20:39:14,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 20:39:14,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 20:39:14,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 20:39:14,231 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:39:14,231 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:39:14,231 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:39:14,231 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 20:39:14,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:39:14,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:39:14,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 20:39:14,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:39:14 BoogieIcfgContainer [2018-12-08 20:39:14,237 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 20:39:14,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:39:14,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:39:14,237 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:39:14,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:39:09" (3/4) ... [2018-12-08 20:39:14,240 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 20:39:14,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:39:14,241 INFO L168 Benchmark]: Toolchain (without parser) took 5002.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 961.4 MB in the beginning and 796.2 MB in the end (delta: 165.2 MB). Peak memory consumption was 428.9 MB. Max. memory is 11.5 GB. [2018-12-08 20:39:14,242 INFO L168 Benchmark]: CDTParser took 0.12 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-08 20:39:14,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.44 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:39:14,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-08 20:39:14,243 INFO L168 Benchmark]: Boogie Preprocessor took 16.26 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-08 20:39:14,243 INFO L168 Benchmark]: RCFGBuilder took 195.63 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.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:39:14,243 INFO L168 Benchmark]: BuchiAutomizer took 4571.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 796.2 MB in the end (delta: 250.6 MB). Peak memory consumption was 432.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:39:14,244 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 796.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:39:14,246 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.12 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 152.44 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.26 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 195.63 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.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4571.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 796.2 MB in the end (delta: 250.6 MB). Peak memory consumption was 432.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.3 GB. Free memory is still 796.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * str + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start + -1 * str and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 3.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 272 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 124 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 341 SDtfs, 842 SDslu, 818 SDs, 0 SdLazy, 859 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf101 lsp90 ukn74 mio100 lsp43 div100 bol100 ite100 ukn100 eq183 hnf86 smp96 dnf205 smp74 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...