./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/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 10cc4caffca660fca2e6a4a0cd5f7ba7ba4e10af ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:32:28,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:32:28,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:32:28,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:32:28,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:32:28,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:32:28,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:32:28,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:32:28,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:32:28,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:32:28,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:32:28,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:32:28,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:32:28,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:32:28,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:32:28,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:32:28,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:32:28,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:32:28,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:32:28,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:32:28,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:32:28,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:32:28,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:32:28,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:32:28,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:32:28,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:32:28,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:32:28,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:32:28,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:32:28,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:32:28,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:32:28,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:32:28,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:32:28,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:32:28,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:32:28,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:32:28,036 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:32:28,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:32:28,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:32:28,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:32:28,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:32:28,053 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:32:28,053 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:32:28,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:32:28,054 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:32:28,055 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:32:28,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:32:28,056 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:32:28,056 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:32:28,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:32:28,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:32:28,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:32:28,056 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:32:28,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:32:28,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:32:28,057 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:32:28,057 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:32:28,058 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_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/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 -> 10cc4caffca660fca2e6a4a0cd5f7ba7ba4e10af [2018-11-23 07:32:28,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:32:28,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:32:28,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:32:28,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:32:28,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:32:28,089 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 07:32:28,123 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/data/e0e7c2c93/6ed3b802ee0a44a99f7679dbd7e6df55/FLAG9b932bf42 [2018-11-23 07:32:28,525 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:32:28,525 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 07:32:28,530 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/data/e0e7c2c93/6ed3b802ee0a44a99f7679dbd7e6df55/FLAG9b932bf42 [2018-11-23 07:32:28,538 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/data/e0e7c2c93/6ed3b802ee0a44a99f7679dbd7e6df55 [2018-11-23 07:32:28,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:32:28,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:32:28,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:32:28,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:32:28,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:32:28,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c28d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28, skipping insertion in model container [2018-11-23 07:32:28,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:32:28,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:32:28,676 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:32:28,683 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:32:28,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:32:28,713 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:32:28,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28 WrapperNode [2018-11-23 07:32:28,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:32:28,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:32:28,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:32:28,714 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:32:28,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:32:28,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:32:28,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:32:28,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:32:28,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... [2018-11-23 07:32:28,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:32:28,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:32:28,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:32:28,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:32:28,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:32:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-23 07:32:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:32:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:32:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:32:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:32:28,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:32:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:32:29,062 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:32:29,062 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 07:32:29,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:32:29 BoogieIcfgContainer [2018-11-23 07:32:29,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:32:29,062 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:32:29,062 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:32:29,066 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:32:29,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:32:29,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:32:28" (1/3) ... [2018-11-23 07:32:29,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@601d5ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:32:29, skipping insertion in model container [2018-11-23 07:32:29,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:32:29,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:32:28" (2/3) ... [2018-11-23 07:32:29,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@601d5ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:32:29, skipping insertion in model container [2018-11-23 07:32:29,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:32:29,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:32:29" (3/3) ... [2018-11-23 07:32:29,070 INFO L375 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-23 07:32:29,116 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:32:29,116 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:32:29,117 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:32:29,117 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:32:29,117 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:32:29,117 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:32:29,117 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:32:29,117 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:32:29,117 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:32:29,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-23 07:32:29,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-23 07:32:29,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:29,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:29,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:32:29,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:32:29,155 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:32:29,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-23 07:32:29,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-23 07:32:29,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:29,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:29,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:32:29,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:32:29,163 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 37#L81-3true [2018-11-23 07:32:29,163 INFO L796 eck$LassoCheckResult]: Loop: 37#L81-3true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 24#L81-2true main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 37#L81-3true [2018-11-23 07:32:29,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 07:32:29,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:29,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 07:32:29,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:29,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 07:32:29,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:29,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:29,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,386 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:32:29,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:32:29,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:32:29,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:32:29,387 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:32:29,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:32:29,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:32:29,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:32:29,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 07:32:29,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:32:29,388 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:32:29,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:29,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:29,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:29,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:29,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:29,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:29,568 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:32:29,572 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:32:29,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:29,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:29,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:29,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:29,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:29,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:29,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:29,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:29,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:29,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:29,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:29,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:29,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:29,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:29,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:29,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:29,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:29,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:29,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:29,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:29,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:29,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:29,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:29,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:29,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:29,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:29,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:29,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:29,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:29,586 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:32:29,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:29,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:29,588 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:32:29,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:29,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:29,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:29,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:29,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:29,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:29,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:29,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:29,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:29,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:29,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:29,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:29,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:29,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:29,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:29,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:29,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:29,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:29,632 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:32:29,654 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:32:29,654 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:32:29,656 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:32:29,658 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:32:29,658 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:32:29,658 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 15 Supporting invariants [] [2018-11-23 07:32:29,663 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 07:32:29,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:29,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:29,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:29,721 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:32:29,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states. Second operand 3 states. [2018-11-23 07:32:29,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states.. Second operand 3 states. Result 102 states and 153 transitions. Complement of second has 7 states. [2018-11-23 07:32:29,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:32:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:32:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2018-11-23 07:32:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 07:32:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 07:32:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 07:32:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:29,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2018-11-23 07:32:29,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:29,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 31 states and 42 transitions. [2018-11-23 07:32:29,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 07:32:29,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:29,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2018-11-23 07:32:29,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:29,782 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-23 07:32:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2018-11-23 07:32:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 07:32:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 07:32:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-11-23 07:32:29,799 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-23 07:32:29,799 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-23 07:32:29,799 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:32:29,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2018-11-23 07:32:29,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:29,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:29,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:29,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:29,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:29,801 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 198#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 199#L81-3 assume !(main_~i~1 < 8); 211#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 208#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 189#L53-4 [2018-11-23 07:32:29,801 INFO L796 eck$LassoCheckResult]: Loop: 189#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 190#L56 assume !parse_expression_list_#t~switch3; 194#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 197#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 192#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 189#L53-4 [2018-11-23 07:32:29,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,801 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-11-23 07:32:29,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:29,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:29,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:29,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:32:29,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:29,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 1 times [2018-11-23 07:32:29,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:29,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:29,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:32:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:32:29,895 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 07:32:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:29,912 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2018-11-23 07:32:29,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:32:29,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-23 07:32:29,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:29,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 42 transitions. [2018-11-23 07:32:29,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:29,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:29,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-11-23 07:32:29,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:29,915 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-23 07:32:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-11-23 07:32:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 07:32:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 07:32:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-11-23 07:32:29,917 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-23 07:32:29,918 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-23 07:32:29,918 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:32:29,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2018-11-23 07:32:29,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:29,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:29,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:29,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:29,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:29,919 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 268#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 272#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 273#L81-3 assume !(main_~i~1 < 8); 280#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 277#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 258#L53-4 [2018-11-23 07:32:29,922 INFO L796 eck$LassoCheckResult]: Loop: 258#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 259#L56 assume !parse_expression_list_#t~switch3; 263#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 266#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 260#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 258#L53-4 [2018-11-23 07:32:29,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2018-11-23 07:32:29,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:29,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:29,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:29,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:29,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:29,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:30,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 07:32:30,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:30,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 2 times [2018-11-23 07:32:30,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:32:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:32:30,051 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 07:32:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:30,063 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-11-23 07:32:30,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:32:30,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2018-11-23 07:32:30,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2018-11-23 07:32:30,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:30,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:30,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-23 07:32:30,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:30,066 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-23 07:32:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-23 07:32:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 07:32:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 07:32:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-11-23 07:32:30,069 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-23 07:32:30,069 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-23 07:32:30,069 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:32:30,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-11-23 07:32:30,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:30,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:30,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 07:32:30,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:30,070 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 360#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 363#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 364#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 372#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 373#L81-3 assume !(main_~i~1 < 8); 371#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 368#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 349#L53-4 [2018-11-23 07:32:30,071 INFO L796 eck$LassoCheckResult]: Loop: 349#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 350#L56 assume !parse_expression_list_#t~switch3; 354#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 357#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 351#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 349#L53-4 [2018-11-23 07:32:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2018-11-23 07:32:30,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:30,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/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-11-23 07:32:30,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 07:32:30,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 07:32:30,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:32:30,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:30,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 07:32:30,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:30,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 3 times [2018-11-23 07:32:30,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:32:30,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:32:30,211 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-23 07:32:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:30,221 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 07:32:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:32:30,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2018-11-23 07:32:30,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 46 transitions. [2018-11-23 07:32:30,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:30,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:30,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2018-11-23 07:32:30,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:30,224 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-23 07:32:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2018-11-23 07:32:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 07:32:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 07:32:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-23 07:32:30,226 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 07:32:30,226 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 07:32:30,226 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:32:30,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-23 07:32:30,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:30,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:30,227 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2018-11-23 07:32:30,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:30,227 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 460#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 461#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 474#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 475#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 465#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 466#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 477#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 476#L81-3 assume !(main_~i~1 < 8); 473#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 470#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 451#L53-4 [2018-11-23 07:32:30,227 INFO L796 eck$LassoCheckResult]: Loop: 451#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 452#L56 assume !parse_expression_list_#t~switch3; 456#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 459#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 453#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 451#L53-4 [2018-11-23 07:32:30,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2018-11-23 07:32:30,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:30,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:30,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:32:30,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 07:32:30,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:32:30,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:30,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 07:32:30,322 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:30,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 4 times [2018-11-23 07:32:30,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:32:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:32:30,381 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 07:32:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:30,408 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-11-23 07:32:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:32:30,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2018-11-23 07:32:30,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 07:32:30,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:30,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:30,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2018-11-23 07:32:30,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:30,413 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 07:32:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2018-11-23 07:32:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 07:32:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 07:32:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 07:32:30,415 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 07:32:30,415 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 07:32:30,415 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:32:30,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2018-11-23 07:32:30,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:30,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:30,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2018-11-23 07:32:30,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:30,418 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 573#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 574#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 587#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 588#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 578#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 579#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 592#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 591#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 590#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 589#L81-3 assume !(main_~i~1 < 8); 586#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 583#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 564#L53-4 [2018-11-23 07:32:30,418 INFO L796 eck$LassoCheckResult]: Loop: 564#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 565#L56 assume !parse_expression_list_#t~switch3; 569#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 572#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 566#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 564#L53-4 [2018-11-23 07:32:30,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2018-11-23 07:32:30,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:30,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:30,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:32:30,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:32:30,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:32:30,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 07:32:30,525 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:30,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 5 times [2018-11-23 07:32:30,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:32:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:32:30,568 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-23 07:32:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:30,583 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-11-23 07:32:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:32:30,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2018-11-23 07:32:30,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 50 transitions. [2018-11-23 07:32:30,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:30,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:30,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2018-11-23 07:32:30,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:30,586 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-11-23 07:32:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2018-11-23 07:32:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 07:32:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 07:32:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2018-11-23 07:32:30,590 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 07:32:30,590 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 07:32:30,590 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:32:30,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2018-11-23 07:32:30,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:30,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:30,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2018-11-23 07:32:30,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:30,592 INFO L794 eck$LassoCheckResult]: Stem: 708#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 697#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 698#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 711#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 712#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 702#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 703#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 718#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 717#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 716#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 715#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 714#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 713#L81-3 assume !(main_~i~1 < 8); 710#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 707#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 688#L53-4 [2018-11-23 07:32:30,592 INFO L796 eck$LassoCheckResult]: Loop: 688#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 689#L56 assume !parse_expression_list_#t~switch3; 693#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 696#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 690#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 688#L53-4 [2018-11-23 07:32:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2018-11-23 07:32:30,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:30,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 07:32:30,655 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 07:32:30,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:32:30,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:30,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 07:32:30,678 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:30,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 6 times [2018-11-23 07:32:30,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:32:30,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:32:30,722 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-23 07:32:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:30,755 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 07:32:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:32:30,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2018-11-23 07:32:30,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2018-11-23 07:32:30,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:30,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:30,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2018-11-23 07:32:30,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:30,758 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-23 07:32:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2018-11-23 07:32:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 07:32:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 07:32:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2018-11-23 07:32:30,762 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-23 07:32:30,762 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-23 07:32:30,762 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 07:32:30,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2018-11-23 07:32:30,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:30,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:30,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2018-11-23 07:32:30,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:30,764 INFO L794 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 832#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 833#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 846#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 847#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 837#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 838#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 855#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 854#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 853#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 852#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 851#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 850#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 849#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 848#L81-3 assume !(main_~i~1 < 8); 845#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 842#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 823#L53-4 [2018-11-23 07:32:30,764 INFO L796 eck$LassoCheckResult]: Loop: 823#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 824#L56 assume !parse_expression_list_#t~switch3; 828#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 831#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 825#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 823#L53-4 [2018-11-23 07:32:30,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2018-11-23 07:32:30,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:30,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:30,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 07:32:30,881 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 07:32:30,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:32:30,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:30,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:30,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 07:32:30,903 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:30,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 7 times [2018-11-23 07:32:30,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:32:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:32:30,939 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-23 07:32:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:30,957 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 07:32:30,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:32:30,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2018-11-23 07:32:30,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 54 transitions. [2018-11-23 07:32:30,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:30,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:30,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 54 transitions. [2018-11-23 07:32:30,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:30,962 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-23 07:32:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 54 transitions. [2018-11-23 07:32:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 07:32:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 07:32:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-23 07:32:30,964 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 07:32:30,964 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 07:32:30,964 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 07:32:30,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2018-11-23 07:32:30,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:30,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:30,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:30,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2018-11-23 07:32:30,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:30,966 INFO L794 eck$LassoCheckResult]: Stem: 989#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 978#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 979#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 992#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 993#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 983#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 984#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1003#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1002#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1001#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1000#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 999#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 998#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 997#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 996#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 995#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 994#L81-3 assume !(main_~i~1 < 8); 991#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 988#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 969#L53-4 [2018-11-23 07:32:30,966 INFO L796 eck$LassoCheckResult]: Loop: 969#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 970#L56 assume !parse_expression_list_#t~switch3; 974#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 977#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 971#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 969#L53-4 [2018-11-23 07:32:30,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:30,966 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2018-11-23 07:32:30,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:30,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:30,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:30,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:31,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:31,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:31,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:31,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:31,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:31,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 07:32:31,106 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:31,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 8 times [2018-11-23 07:32:31,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:31,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 07:32:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 07:32:31,149 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-23 07:32:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:31,170 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 07:32:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:32:31,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2018-11-23 07:32:31,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:31,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 07:32:31,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 07:32:31,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 07:32:31,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2018-11-23 07:32:31,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:31,174 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 07:32:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2018-11-23 07:32:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 07:32:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 07:32:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 07:32:31,177 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 07:32:31,177 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 07:32:31,177 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 07:32:31,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2018-11-23 07:32:31,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:32:31,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:31,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:31,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2018-11-23 07:32:31,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:31,178 INFO L794 eck$LassoCheckResult]: Stem: 1145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1135#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1136#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1139#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1140#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1148#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1161#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1160#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1159#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1158#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1157#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1156#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1155#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1154#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1153#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1152#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1151#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1150#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1149#L81-3 assume !(main_~i~1 < 8); 1147#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 1144#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1125#L53-4 [2018-11-23 07:32:31,178 INFO L796 eck$LassoCheckResult]: Loop: 1125#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1126#L56 assume !parse_expression_list_#t~switch3; 1130#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 1133#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1127#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1125#L53-4 [2018-11-23 07:32:31,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:31,179 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2018-11-23 07:32:31,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:31,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 55351743, now seen corresponding path program 9 times [2018-11-23 07:32:31,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:31,204 INFO L82 PathProgramCache]: Analyzing trace with hash 298997766, now seen corresponding path program 1 times [2018-11-23 07:32:31,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:31,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:34,727 WARN L180 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 190 DAG size of output: 149 [2018-11-23 07:32:34,861 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-23 07:32:34,862 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:32:34,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:32:34,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:32:34,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:32:34,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:32:34,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:32:34,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:32:34,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:32:34,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-23 07:32:34,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:32:34,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:32:34,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:34,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:35,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:32:35,121 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:32:35,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:35,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:35,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:35,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,185 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:32:35,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:32:35,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:35,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:35,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:35,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:35,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:35,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:35,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:35,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:35,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:32:35,211 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:32:35,211 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:32:35,211 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:32:35,213 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:32:35,213 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:32:35,214 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-23 07:32:35,259 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 07:32:35,261 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:32:35,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:35,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:35,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:35,306 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:32:35,307 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 07:32:35,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 71 states and 90 transitions. Complement of second has 4 states. [2018-11-23 07:32:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:32:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:32:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-23 07:32:35,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-23 07:32:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:35,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-23 07:32:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:35,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-23 07:32:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:35,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2018-11-23 07:32:35,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:35,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 58 states and 74 transitions. [2018-11-23 07:32:35,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 07:32:35,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 07:32:35,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 74 transitions. [2018-11-23 07:32:35,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:35,337 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2018-11-23 07:32:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 74 transitions. [2018-11-23 07:32:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 07:32:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 07:32:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2018-11-23 07:32:35,339 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-11-23 07:32:35,339 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-11-23 07:32:35,343 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 07:32:35,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 73 transitions. [2018-11-23 07:32:35,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:35,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:35,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:35,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:35,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:32:35,345 INFO L794 eck$LassoCheckResult]: Stem: 1394#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1383#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1384#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1388#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1389#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1398#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1411#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1410#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1409#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1408#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1407#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1406#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1405#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1404#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1403#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1402#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1401#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1400#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1399#L81-3 assume !(main_~i~1 < 8); 1397#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 1393#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1369#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1370#L56 assume parse_expression_list_#t~switch3; 1377#L57-5 [2018-11-23 07:32:35,345 INFO L796 eck$LassoCheckResult]: Loop: 1377#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1378#L57-1 assume parse_expression_list_#t~short6; 1395#L57-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 1377#L57-5 [2018-11-23 07:32:35,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2018-11-23 07:32:35,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:35,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2018-11-23 07:32:35,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:35,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2018-11-23 07:32:35,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:35,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:35,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:35,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:35,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:35,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:32:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:32:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:32:35,543 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. cyclomatic complexity: 20 Second operand 7 states. [2018-11-23 07:32:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:35,650 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-23 07:32:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:32:35,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 116 transitions. [2018-11-23 07:32:35,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 07:32:35,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 116 transitions. [2018-11-23 07:32:35,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 07:32:35,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 07:32:35,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 116 transitions. [2018-11-23 07:32:35,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:35,653 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 116 transitions. [2018-11-23 07:32:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 116 transitions. [2018-11-23 07:32:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2018-11-23 07:32:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 07:32:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2018-11-23 07:32:35,655 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 82 transitions. [2018-11-23 07:32:35,655 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 82 transitions. [2018-11-23 07:32:35,655 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 07:32:35,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 82 transitions. [2018-11-23 07:32:35,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:35,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:35,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:35,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:35,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:32:35,657 INFO L794 eck$LassoCheckResult]: Stem: 1563#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1549#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1550#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1557#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1558#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1569#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1582#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1581#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1580#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1579#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1578#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1577#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1576#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1575#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1574#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1573#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1572#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1571#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1570#L81-3 assume !(main_~i~1 < 8); 1566#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 1562#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1535#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1536#L56 assume !parse_expression_list_#t~switch3; 1543#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 1548#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1539#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1537#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1538#L56 assume parse_expression_list_#t~switch3; 1544#L57-5 [2018-11-23 07:32:35,657 INFO L796 eck$LassoCheckResult]: Loop: 1544#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1545#L57-1 assume parse_expression_list_#t~short6; 1584#L57-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 1544#L57-5 [2018-11-23 07:32:35,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash -425954903, now seen corresponding path program 1 times [2018-11-23 07:32:35,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:35,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:35,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:35,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2018-11-23 07:32:35,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:35,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:35,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2005877280, now seen corresponding path program 1 times [2018-11-23 07:32:35,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:35,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:35,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:35,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:38,539 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 232 DAG size of output: 171 [2018-11-23 07:32:38,671 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 07:32:38,673 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:32:38,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:32:38,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:32:38,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:32:38,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:32:38,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:32:38,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:32:38,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:32:38,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-23 07:32:38,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:32:38,673 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:32:38,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:38,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:39,009 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:32:39,009 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:32:39,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:39,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:39,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:39,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:39,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:39,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:39,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:39,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:39,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:39,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:39,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:39,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:39,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:39,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:39,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:39,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:39,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:39,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:39,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:39,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:39,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:39,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:32:39,061 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 07:32:39,061 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 07:32:39,061 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:32:39,062 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:32:39,062 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:32:39,062 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2, ULTIMATE.start_parse_expression_list_~start~0) = -1*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 Supporting invariants [] [2018-11-23 07:32:39,102 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 07:32:39,103 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:32:39,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:39,149 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:32:39,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 82 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-23 07:32:39,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 82 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 171 states and 232 transitions. Complement of second has 7 states. [2018-11-23 07:32:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:32:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:32:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 07:32:39,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 28 letters. Loop has 3 letters. [2018-11-23 07:32:39,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:39,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-23 07:32:39,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:39,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 28 letters. Loop has 6 letters. [2018-11-23 07:32:39,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:39,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 232 transitions. [2018-11-23 07:32:39,190 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-23 07:32:39,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 133 states and 178 transitions. [2018-11-23 07:32:39,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 07:32:39,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 07:32:39,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 178 transitions. [2018-11-23 07:32:39,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:39,194 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 178 transitions. [2018-11-23 07:32:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 178 transitions. [2018-11-23 07:32:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 90. [2018-11-23 07:32:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 07:32:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2018-11-23 07:32:39,198 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 121 transitions. [2018-11-23 07:32:39,198 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 121 transitions. [2018-11-23 07:32:39,198 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 07:32:39,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 121 transitions. [2018-11-23 07:32:39,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:39,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:39,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:39,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:39,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:32:39,200 INFO L794 eck$LassoCheckResult]: Stem: 1949#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1936#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1937#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1943#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1944#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1956#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1969#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1968#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1967#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1966#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1965#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1964#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1963#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1962#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1961#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1960#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1959#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1958#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1957#L81-3 assume !(main_~i~1 < 8); 1954#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 1948#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1915#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1916#L56 assume parse_expression_list_#t~switch3; 1927#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1928#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 1950#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 1921#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1922#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 1906#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1938#L60-8 [2018-11-23 07:32:39,200 INFO L796 eck$LassoCheckResult]: Loop: 1938#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1911#L60-1 assume !parse_expression_list_#t~short13; 1912#L60-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1938#L60-8 [2018-11-23 07:32:39,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2018-11-23 07:32:39,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:39,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:39,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:32:39,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:39,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2018-11-23 07:32:39,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:39,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:39,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:32:39,350 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:32:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:32:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:32:39,350 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. cyclomatic complexity: 38 Second operand 3 states. [2018-11-23 07:32:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:39,375 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2018-11-23 07:32:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:32:39,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 122 transitions. [2018-11-23 07:32:39,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:39,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 91 states and 121 transitions. [2018-11-23 07:32:39,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 07:32:39,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 07:32:39,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 121 transitions. [2018-11-23 07:32:39,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:39,378 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 121 transitions. [2018-11-23 07:32:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 121 transitions. [2018-11-23 07:32:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 07:32:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 07:32:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2018-11-23 07:32:39,380 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 121 transitions. [2018-11-23 07:32:39,380 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 121 transitions. [2018-11-23 07:32:39,380 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 07:32:39,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 121 transitions. [2018-11-23 07:32:39,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:39,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:39,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:39,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:39,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:39,382 INFO L794 eck$LassoCheckResult]: Stem: 2139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2124#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2125#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2133#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2134#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2145#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2183#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2181#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2180#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2179#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2178#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2177#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2176#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2175#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2174#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2173#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2170#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2147#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2146#L81-3 assume !(main_~i~1 < 8); 2142#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 2138#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2107#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2108#L56 assume parse_expression_list_#t~switch3; 2116#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2117#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 2166#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 2165#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2148#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 2099#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2127#L60-8 [2018-11-23 07:32:39,382 INFO L796 eck$LassoCheckResult]: Loop: 2127#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2104#L60-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 2094#L60-2 assume parse_expression_list_#t~short12; 2095#L60-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2126#L60-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 2127#L60-8 [2018-11-23 07:32:39,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 2 times [2018-11-23 07:32:39,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:39,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:39,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:32:39,497 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:39,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2018-11-23 07:32:39,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:32:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:32:39,550 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. cyclomatic complexity: 37 Second operand 7 states. [2018-11-23 07:32:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:39,657 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2018-11-23 07:32:39,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:32:39,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 157 transitions. [2018-11-23 07:32:39,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 07:32:39,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 115 states and 149 transitions. [2018-11-23 07:32:39,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-23 07:32:39,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-23 07:32:39,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 149 transitions. [2018-11-23 07:32:39,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:39,660 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 149 transitions. [2018-11-23 07:32:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 149 transitions. [2018-11-23 07:32:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2018-11-23 07:32:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 07:32:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2018-11-23 07:32:39,662 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 115 transitions. [2018-11-23 07:32:39,662 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 115 transitions. [2018-11-23 07:32:39,662 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 07:32:39,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 115 transitions. [2018-11-23 07:32:39,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:39,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:39,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:39,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:39,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:39,667 INFO L794 eck$LassoCheckResult]: Stem: 2368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2354#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2355#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2362#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2363#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2372#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2385#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2384#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2383#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2382#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2381#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2380#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2379#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2378#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2377#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2376#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2375#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2374#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2373#L81-3 assume !(main_~i~1 < 8); 2371#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 2367#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2339#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2340#L56 assume parse_expression_list_#t~switch3; 2349#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2350#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 2369#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 2344#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2326#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2327#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2357#L60-8 [2018-11-23 07:32:39,667 INFO L796 eck$LassoCheckResult]: Loop: 2357#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2336#L60-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 2330#L60-2 assume parse_expression_list_#t~short12; 2331#L60-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2356#L60-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 2357#L60-8 [2018-11-23 07:32:39,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2018-11-23 07:32:39,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,689 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2018-11-23 07:32:39,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2018-11-23 07:32:39,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:32:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:32:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:32:39,780 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. cyclomatic complexity: 35 Second operand 6 states. [2018-11-23 07:32:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:39,820 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2018-11-23 07:32:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:32:39,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 170 transitions. [2018-11-23 07:32:39,822 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:32:39,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 125 states and 162 transitions. [2018-11-23 07:32:39,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 07:32:39,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 07:32:39,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 162 transitions. [2018-11-23 07:32:39,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:39,823 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 162 transitions. [2018-11-23 07:32:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 162 transitions. [2018-11-23 07:32:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2018-11-23 07:32:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 07:32:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2018-11-23 07:32:39,825 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2018-11-23 07:32:39,825 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2018-11-23 07:32:39,825 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 07:32:39,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 118 transitions. [2018-11-23 07:32:39,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:39,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:39,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:39,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:39,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:39,827 INFO L794 eck$LassoCheckResult]: Stem: 2610#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2593#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2594#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2603#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2604#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2617#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2637#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2636#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2635#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2634#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2633#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2632#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2630#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2628#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2626#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2624#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2622#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2620#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2619#L81-3 assume !(main_~i~1 < 8); 2614#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 2608#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2576#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2577#L56 assume !parse_expression_list_#t~switch3; 2600#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 2653#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2652#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2578#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2579#L56 assume parse_expression_list_#t~switch3; 2601#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2643#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 2611#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 2612#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2563#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2564#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2597#L60-8 [2018-11-23 07:32:39,827 INFO L796 eck$LassoCheckResult]: Loop: 2597#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2573#L60-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 2567#L60-2 assume parse_expression_list_#t~short12; 2568#L60-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2596#L60-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 2597#L60-8 [2018-11-23 07:32:39,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1211894518, now seen corresponding path program 1 times [2018-11-23 07:32:39,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2018-11-23 07:32:39,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:39,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 887981297, now seen corresponding path program 1 times [2018-11-23 07:32:39,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:39,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:39,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:39,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:39,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:39,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:39,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:39,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:39,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 07:32:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:32:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:32:40,018 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. cyclomatic complexity: 34 Second operand 7 states. [2018-11-23 07:32:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:40,078 INFO L93 Difference]: Finished difference Result 179 states and 236 transitions. [2018-11-23 07:32:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:32:40,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 236 transitions. [2018-11-23 07:32:40,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 07:32:40,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 164 states and 214 transitions. [2018-11-23 07:32:40,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 07:32:40,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 07:32:40,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 214 transitions. [2018-11-23 07:32:40,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:40,081 INFO L705 BuchiCegarLoop]: Abstraction has 164 states and 214 transitions. [2018-11-23 07:32:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 214 transitions. [2018-11-23 07:32:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2018-11-23 07:32:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 07:32:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2018-11-23 07:32:40,084 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 170 transitions. [2018-11-23 07:32:40,084 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 170 transitions. [2018-11-23 07:32:40,084 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 07:32:40,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 170 transitions. [2018-11-23 07:32:40,085 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:32:40,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:40,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:40,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:32:40,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:32:40,088 INFO L794 eck$LassoCheckResult]: Stem: 3013#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2998#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2999#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3006#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3007#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3018#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3034#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3033#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3032#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3031#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3030#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3029#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3028#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3027#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3026#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3025#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3024#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3021#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3020#L81-3 assume !(main_~i~1 < 8); 3016#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 3012#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2982#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2983#L56 assume !parse_expression_list_#t~switch3; 3069#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 3068#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3067#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3066#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3064#L56 assume !parse_expression_list_#t~switch3; 3052#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 3063#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3058#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3055#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3051#L56 assume parse_expression_list_#t~switch3; 3047#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3045#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 3042#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 3040#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3035#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 2970#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3001#L60-8 [2018-11-23 07:32:40,088 INFO L796 eck$LassoCheckResult]: Loop: 3001#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2979#L60-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 2973#L60-2 assume parse_expression_list_#t~short12; 2974#L60-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 3000#L60-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 3001#L60-8 [2018-11-23 07:32:40,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1063984012, now seen corresponding path program 1 times [2018-11-23 07:32:40,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:40,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:40,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 4 times [2018-11-23 07:32:40,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:40,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:40,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:40,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:40,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1331731941, now seen corresponding path program 1 times [2018-11-23 07:32:40,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:40,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:40,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:45,769 WARN L180 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 287 DAG size of output: 200 [2018-11-23 07:32:45,908 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 07:32:45,909 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:32:45,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:32:45,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:32:45,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:32:45,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:32:45,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:32:45,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:32:45,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:32:45,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-23 07:32:45,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:32:45,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:32:45,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:45,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,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-11-23 07:32:46,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:32:46,239 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:32:46,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:32:46,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:46,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:46,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:46,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:46,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:46,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:46,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:46,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:46,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:46,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:46,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:46,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:46,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:46,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:46,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:46,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:46,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:46,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:32:46,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:32:46,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:32:46,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:46,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:46,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,253 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:32:46,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,254 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:32:46,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:46,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:46,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:46,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:46,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:46,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:32:46,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:32:46,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:32:46,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:32:46,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:32:46,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:32:46,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:32:46,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:32:46,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:32:46,273 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:32:46,273 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:32:46,274 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:32:46,274 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:32:46,274 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:32:46,274 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-11-23 07:32:46,345 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 07:32:46,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:46,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:46,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:32:46,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 07:32:46,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 130 states and 170 transitions. cyclomatic complexity: 50 Second operand 4 states. [2018-11-23 07:32:46,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 130 states and 170 transitions. cyclomatic complexity: 50. Second operand 4 states. Result 285 states and 379 transitions. Complement of second has 11 states. [2018-11-23 07:32:46,468 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-11-23 07:32:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:32:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2018-11-23 07:32:46,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 80 transitions. Stem has 39 letters. Loop has 5 letters. [2018-11-23 07:32:46,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:46,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 80 transitions. Stem has 44 letters. Loop has 5 letters. [2018-11-23 07:32:46,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:46,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 80 transitions. Stem has 39 letters. Loop has 10 letters. [2018-11-23 07:32:46,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:32:46,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 379 transitions. [2018-11-23 07:32:46,471 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2018-11-23 07:32:46,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 188 states and 247 transitions. [2018-11-23 07:32:46,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 07:32:46,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 07:32:46,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 247 transitions. [2018-11-23 07:32:46,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:46,473 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 247 transitions. [2018-11-23 07:32:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 247 transitions. [2018-11-23 07:32:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 136. [2018-11-23 07:32:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 07:32:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2018-11-23 07:32:46,477 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2018-11-23 07:32:46,478 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2018-11-23 07:32:46,478 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 07:32:46,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2018-11-23 07:32:46,478 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:32:46,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:46,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:46,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 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, 1, 1] [2018-11-23 07:32:46,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:32:46,479 INFO L794 eck$LassoCheckResult]: Stem: 3631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3613#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 3614#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3624#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3625#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3637#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3650#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3649#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3648#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3647#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3646#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3645#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3644#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3643#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3642#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3641#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3640#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3639#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3638#L81-3 assume !(main_~i~1 < 8); 3635#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 3630#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3597#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3598#L56 assume parse_expression_list_#t~switch3; 3678#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3677#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 3676#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 3675#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3674#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 3673#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3672#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3671#L60-1 assume !parse_expression_list_#t~short13; 3670#L60-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13; 3669#L60-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 3668#L61 assume !parse_expression_list_#t~short16; 3667#L61-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 3666#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3665#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(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 parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.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; 3664#L5 assume !(0 == __VERIFIER_assert_~cond); 3663#L5-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); 3662#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3661#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 3660#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3659#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3658#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3656#L56 assume parse_expression_list_#t~switch3; 3633#L57-5 [2018-11-23 07:32:46,479 INFO L796 eck$LassoCheckResult]: Loop: 3633#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3655#L57-1 assume parse_expression_list_#t~short6; 3632#L57-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 3633#L57-5 [2018-11-23 07:32:46,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 316805878, now seen corresponding path program 1 times [2018-11-23 07:32:46,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 07:32:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:32:46,551 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:46,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2018-11-23 07:32:46,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:32:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:32:46,601 INFO L87 Difference]: Start difference. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 7 states. [2018-11-23 07:32:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:46,724 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2018-11-23 07:32:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:32:46,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 153 transitions. [2018-11-23 07:32:46,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:46,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 106 states and 138 transitions. [2018-11-23 07:32:46,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 07:32:46,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 07:32:46,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 138 transitions. [2018-11-23 07:32:46,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:46,726 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 138 transitions. [2018-11-23 07:32:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 138 transitions. [2018-11-23 07:32:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 07:32:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 07:32:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2018-11-23 07:32:46,728 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 138 transitions. [2018-11-23 07:32:46,728 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 138 transitions. [2018-11-23 07:32:46,728 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 07:32:46,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 138 transitions. [2018-11-23 07:32:46,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:46,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:46,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:46,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 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, 1, 1] [2018-11-23 07:32:46,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:32:46,729 INFO L794 eck$LassoCheckResult]: Stem: 3901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3886#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 3887#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3895#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3896#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3906#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3928#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3926#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3923#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3921#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3919#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3918#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3917#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3915#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3913#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3910#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3909#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3908#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3907#L81-3 assume !(main_~i~1 < 8); 3905#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 3900#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3870#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3871#L56 assume !parse_expression_list_#t~switch3; 3894#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 3956#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3954#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3872#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3873#L56 assume parse_expression_list_#t~switch3; 3883#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3884#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 3962#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 3961#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3959#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 3860#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3893#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3868#L60-1 assume !parse_expression_list_#t~short13; 3869#L60-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13; 3916#L60-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 3914#L61 assume !parse_expression_list_#t~short16; 3912#L61-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 3898#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3888#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(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 parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.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; 3865#L5 assume !(0 == __VERIFIER_assert_~cond); 3866#L5-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); 3878#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3879#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 3949#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3946#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3945#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3943#L56 assume parse_expression_list_#t~switch3; 3881#L57-5 [2018-11-23 07:32:46,729 INFO L796 eck$LassoCheckResult]: Loop: 3881#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3882#L57-1 assume parse_expression_list_#t~short6; 3902#L57-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 3881#L57-5 [2018-11-23 07:32:46,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 144847204, now seen corresponding path program 1 times [2018-11-23 07:32:46,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 07:32:46,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:32:46,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 07:32:46,844 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:46,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2018-11-23 07:32:46,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:46,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:32:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:32:46,890 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. cyclomatic complexity: 40 Second operand 9 states. [2018-11-23 07:32:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:47,051 INFO L93 Difference]: Finished difference Result 178 states and 238 transitions. [2018-11-23 07:32:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:32:47,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 238 transitions. [2018-11-23 07:32:47,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 07:32:47,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 157 states and 207 transitions. [2018-11-23 07:32:47,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 07:32:47,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 07:32:47,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 207 transitions. [2018-11-23 07:32:47,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:32:47,054 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 207 transitions. [2018-11-23 07:32:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 207 transitions. [2018-11-23 07:32:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2018-11-23 07:32:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 07:32:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 164 transitions. [2018-11-23 07:32:47,056 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 164 transitions. [2018-11-23 07:32:47,056 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 164 transitions. [2018-11-23 07:32:47,056 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 07:32:47,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 164 transitions. [2018-11-23 07:32:47,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:32:47,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:32:47,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:32:47,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 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, 1, 1] [2018-11-23 07:32:47,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:32:47,058 INFO L794 eck$LassoCheckResult]: Stem: 4214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4198#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 4199#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4208#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4209#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4221#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4234#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4233#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4232#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4231#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4230#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4229#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4228#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4227#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4226#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4225#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4224#L81-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4223#L81-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4222#L81-3 assume !(main_~i~1 < 8); 4220#L81-4 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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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); 4213#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4180#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4181#L56 assume !parse_expression_list_#t~switch3; 4204#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4191#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4192#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 4182#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4183#L56 assume parse_expression_list_#t~switch3; 4267#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4282#L57-1 assume !parse_expression_list_#t~short6;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~short6 := 9 == parse_expression_list_#t~mem5; 4280#L57-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4; 4279#L57-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4169#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 4170#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4205#L60-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4178#L60-1 assume !parse_expression_list_#t~short13; 4179#L60-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13; 4239#L60-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 4237#L61 assume !parse_expression_list_#t~short16; 4236#L61-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 4211#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4197#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(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 parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.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; 4175#L5 assume !(0 == __VERIFIER_assert_~cond); 4176#L5-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); 4189#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4190#L55 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4252#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4251#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 4250#L53-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4249#L56 assume parse_expression_list_#t~switch3; 4193#L57-5 [2018-11-23 07:32:47,058 INFO L796 eck$LassoCheckResult]: Loop: 4193#L57-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4194#L57-1 assume parse_expression_list_#t~short6; 4215#L57-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 4193#L57-5 [2018-11-23 07:32:47,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1849297502, now seen corresponding path program 1 times [2018-11-23 07:32:47,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:47,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:47,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:32:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 07:32:47,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:32:47,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61817a3c-4e1b-4334-b0cd-fe7f4bc0759d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:32:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:32:47,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:32:47,227 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 6 treesize of output 5 [2018-11-23 07:32:47,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 07:32:47,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:32:47,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:32:47,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 07:32:47,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 07:32:47,283 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-11-23 07:32:47,285 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-11-23 07:32:47,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,301 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-11-23 07:32:47,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2018-11-23 07:32:47,325 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-11-23 07:32:47,328 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-11-23 07:32:47,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,333 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:32:47,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 07:32:47,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:32:47,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2018-11-23 07:32:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 07:32:47,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:32:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-11-23 07:32:47,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:32:47,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:32:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2018-11-23 07:32:47,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:32:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:32:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:32:47,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:32:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:32:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 07:32:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:32:47,399 INFO L87 Difference]: Start difference. First operand 125 states and 164 transitions. cyclomatic complexity: 47 Second operand 12 states. [2018-11-23 07:32:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:32:47,540 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2018-11-23 07:32:47,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:32:47,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 111 transitions. [2018-11-23 07:32:47,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:32:47,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2018-11-23 07:32:47,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:32:47,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:32:47,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:32:47,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:32:47,541 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:32:47,541 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:32:47,541 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:32:47,541 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 07:32:47,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:32:47,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:32:47,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:32:47,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:32:47 BoogieIcfgContainer [2018-11-23 07:32:47,547 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:32:47,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:32:47,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:32:47,547 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:32:47,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:32:29" (3/4) ... [2018-11-23 07:32:47,551 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:32:47,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:32:47,551 INFO L168 Benchmark]: Toolchain (without parser) took 19011.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 355.5 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -241.1 MB). Peak memory consumption was 114.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:32:47,552 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:32:47,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:32:47,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:32:47,553 INFO L168 Benchmark]: Boogie Preprocessor took 22.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:32:47,553 INFO L168 Benchmark]: RCFGBuilder took 259.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:32:47,554 INFO L168 Benchmark]: BuchiAutomizer took 18484.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 211.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.4 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:32:47,554 INFO L168 Benchmark]: Witness Printer took 3.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:32:47,557 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 259.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18484.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 211.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.4 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. 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 20 terminating modules (16 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 15 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * str + unknown-#length-unknown[str] + -1 * start and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 16 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.4s and 21 iterations. TraceHistogramMax:8. Analysis of lassos took 16.8s. Construction of modules took 0.5s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 256 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 136 states and ocurred in iteration 17. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 720 SDtfs, 962 SDslu, 1990 SDs, 0 SdLazy, 847 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU12 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax100 hnf100 lsp92 ukn56 mio100 lsp53 div100 bol100 ite100 ukn100 eq168 hnf88 smp99 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...