./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/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 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:24:21,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:24:21,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:24:21,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:24:21,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:24:21,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:24:21,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:24:21,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:24:21,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:24:21,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:24:21,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:24:21,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:24:21,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:24:21,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:24:21,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:24:21,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:24:21,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:24:21,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:24:21,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:24:21,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:24:21,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:24:21,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:24:21,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:24:21,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:24:21,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:24:21,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:24:21,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:24:21,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:24:21,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:24:21,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:24:21,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:24:21,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:24:21,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:24:21,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:24:21,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:24:21,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:24:21,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:24:21,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:24:21,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:24:21,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:24:21,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:24:21,474 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:24:21,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:24:21,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:24:21,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:24:21,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:24:21,507 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:24:21,508 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:24:21,508 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:24:21,508 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:24:21,508 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:24:21,509 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:24:21,510 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:24:21,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:24:21,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:24:21,511 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:24:21,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:24:21,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:24:21,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:24:21,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:24:21,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:24:21,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:24:21,513 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:24:21,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:24:21,514 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:24:21,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:24:21,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:24:21,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:24:21,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:24:21,516 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:24:21,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:24:21,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:24:21,517 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:24:21,518 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:24:21,518 INFO L138 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/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/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 -> 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b [2019-11-15 23:24:21,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:24:21,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:24:21,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:24:21,577 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:24:21,577 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:24:21,578 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-15 23:24:21,643 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/data/5b1570ff0/f032efefa4084297a4acc39201298d9c/FLAG92f021890 [2019-11-15 23:24:22,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:24:22,046 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-15 23:24:22,053 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/data/5b1570ff0/f032efefa4084297a4acc39201298d9c/FLAG92f021890 [2019-11-15 23:24:22,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/data/5b1570ff0/f032efefa4084297a4acc39201298d9c [2019-11-15 23:24:22,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:24:22,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:24:22,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:22,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:24:22,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:24:22,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28445939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22, skipping insertion in model container [2019-11-15 23:24:22,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:24:22,102 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:24:22,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:22,377 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:24:22,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:22,428 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:24:22,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22 WrapperNode [2019-11-15 23:24:22,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:22,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:22,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:24:22,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:24:22,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:22,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:24:22,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:24:22,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:24:22,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... [2019-11-15 23:24:22,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:24:22,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:24:22,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:24:22,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:24:22,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/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 [2019-11-15 23:24:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:24:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:24:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:24:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-15 23:24:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:24:22,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:24:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:24:22,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:24:22,942 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-15 23:24:22,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:22 BoogieIcfgContainer [2019-11-15 23:24:22,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:24:22,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:24:22,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:24:22,948 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:24:22,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:22,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:24:22" (1/3) ... [2019-11-15 23:24:22,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ecc99e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:22, skipping insertion in model container [2019-11-15 23:24:22,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:22,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:22" (2/3) ... [2019-11-15 23:24:22,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ecc99e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:22, skipping insertion in model container [2019-11-15 23:24:22,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:22,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:22" (3/3) ... [2019-11-15 23:24:22,953 INFO L371 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-15 23:24:23,003 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:24:23,003 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:24:23,003 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:24:23,004 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:24:23,004 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:24:23,004 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:24:23,004 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:24:23,004 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:24:23,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-15 23:24:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-15 23:24:23,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:23,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:23,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:24:23,052 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:23,052 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:24:23,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-15 23:24:23,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-15 23:24:23,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:23,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:23,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:24:23,056 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:23,063 INFO L791 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 31#L79-3true [2019-11-15 23:24:23,064 INFO L793 eck$LassoCheckResult]: Loop: 31#L79-3true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 36#L79-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 31#L79-3true [2019-11-15 23:24:23,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:23,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:24:23,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:23,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426702439] [2019-11-15 23:24:23,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:23,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:23,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:23,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:23,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:23,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 23:24:23,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:23,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986537346] [2019-11-15 23:24:23,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:23,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:23,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:23,214 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:23,216 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 23:24:23,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:23,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747928075] [2019-11-15 23:24:23,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:23,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:23,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:23,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:23,427 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:23,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:23,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:23,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:23,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:23,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:23,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:23,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:23,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-11-15 23:24:23,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:23,429 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:23,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:23,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:23,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:23,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:23,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:23,727 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:23,733 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:23,735 INFO L120 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 [2019-11-15 23:24:23,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:23,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,741 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:23,741 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:23,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,748 INFO L120 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 [2019-11-15 23:24:23,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:23,758 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:23,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,777 INFO L120 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 [2019-11-15 23:24:23,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:23,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:23,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:23,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,786 INFO L120 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 [2019-11-15 23:24:23,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:23,790 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:23,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,794 INFO L120 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 [2019-11-15 23:24:23,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:23,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:23,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:23,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,798 INFO L120 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 [2019-11-15 23:24:23,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,799 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:24:23,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,802 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:24:23,803 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:23,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,815 INFO L120 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 [2019-11-15 23:24:23,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:23,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:23,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:23,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:23,819 INFO L120 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 [2019-11-15 23:24:23,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:23,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:23,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:23,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:23,824 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:23,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:23,893 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:23,957 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:24:23,958 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:24:23,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:23,962 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:23,962 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:23,963 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 15 Supporting invariants [] [2019-11-15 23:24:23,968 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:24:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:24,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:24,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,054 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 [2019-11-15 23:24:24,055 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-11-15 23:24:24,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 105 states and 156 transitions. Complement of second has 7 states. [2019-11-15 23:24:24,121 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 [2019-11-15 23:24:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-11-15 23:24:24,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 23:24:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:24,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:24:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:24:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:24,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 156 transitions. [2019-11-15 23:24:24,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 32 states and 43 transitions. [2019-11-15 23:24:24,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 23:24:24,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:24,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-11-15 23:24:24,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:24,141 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 23:24:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-11-15 23:24:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-15 23:24:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:24:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-15 23:24:24,165 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 23:24:24,165 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 23:24:24,165 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:24:24,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-15 23:24:24,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:24,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:24,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:24,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:24,168 INFO L791 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 196#L79-3 assume !(main_~i~1 < 8); 211#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 191#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 192#L52-4 [2019-11-15 23:24:24,168 INFO L793 eck$LassoCheckResult]: Loop: 192#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 205#L55 assume !parse_expression_list_#t~switch4; 200#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 201#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 207#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 192#L52-4 [2019-11-15 23:24:24,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-11-15 23:24:24,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423536225] [2019-11-15 23:24:24,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423536225] [2019-11-15 23:24:24,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:24,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:24:24,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051145456] [2019-11-15 23:24:24,214 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2019-11-15 23:24:24,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954414873] [2019-11-15 23:24:24,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:24,227 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:24,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:24,316 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 23:24:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:24,332 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-15 23:24:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:24,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-15 23:24:24,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-15 23:24:24,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:24,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:24,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-15 23:24:24,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:24,340 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 23:24:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-15 23:24:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-15 23:24:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:24:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-15 23:24:24,344 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-15 23:24:24,344 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-15 23:24:24,344 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:24:24,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-11-15 23:24:24,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:24,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:24,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:24,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:24,346 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 266#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 267#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 283#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 284#L79-3 assume !(main_~i~1 < 8); 282#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 260#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 261#L52-4 [2019-11-15 23:24:24,346 INFO L793 eck$LassoCheckResult]: Loop: 261#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 276#L55 assume !parse_expression_list_#t~switch4; 271#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 272#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 277#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 261#L52-4 [2019-11-15 23:24:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2019-11-15 23:24:24,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289453295] [2019-11-15 23:24:24,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289453295] [2019-11-15 23:24:24,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913031659] [2019-11-15 23:24:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:24:24,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,459 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:24,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 23:24:24,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279188522] [2019-11-15 23:24:24,460 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2019-11-15 23:24:24,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516548230] [2019-11-15 23:24:24,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:24,471 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:24,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:24,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:24:24,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:24:24,544 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-15 23:24:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:24,578 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-11-15 23:24:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:24:24,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-11-15 23:24:24,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2019-11-15 23:24:24,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:24,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:24,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-15 23:24:24,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:24,584 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 23:24:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-15 23:24:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-15 23:24:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 23:24:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-11-15 23:24:24,594 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 23:24:24,594 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 23:24:24,594 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:24:24,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-11-15 23:24:24,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:24,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:24,598 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-15 23:24:24,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:24,599 INFO L791 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 360#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 376#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 377#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 378#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 382#L79-3 assume !(main_~i~1 < 8); 375#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 353#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 354#L52-4 [2019-11-15 23:24:24,599 INFO L793 eck$LassoCheckResult]: Loop: 354#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 369#L55 assume !parse_expression_list_#t~switch4; 364#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 365#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 370#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 354#L52-4 [2019-11-15 23:24:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2019-11-15 23:24:24,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507210515] [2019-11-15 23:24:24,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507210515] [2019-11-15 23:24:24,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83330710] [2019-11-15 23:24:24,671 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:24,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:24:24,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:24:24,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:24,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,755 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:24,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 23:24:24,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813190855] [2019-11-15 23:24:24,755 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2019-11-15 23:24:24,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406262447] [2019-11-15 23:24:24,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:24,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:24,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:24:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:24:24,873 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-15 23:24:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:24,898 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-15 23:24:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:24:24,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-11-15 23:24:24,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2019-11-15 23:24:24,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:24,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:24,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-11-15 23:24:24,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:24,905 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-11-15 23:24:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-11-15 23:24:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-15 23:24:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:24:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-11-15 23:24:24,909 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-15 23:24:24,909 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-15 23:24:24,909 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:24:24,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2019-11-15 23:24:24,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:24,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:24,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:24,911 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-11-15 23:24:24,911 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:24,911 INFO L791 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 463#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 464#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 480#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 486#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 488#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 481#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 482#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 487#L79-3 assume !(main_~i~1 < 8); 479#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 457#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 458#L52-4 [2019-11-15 23:24:24,911 INFO L793 eck$LassoCheckResult]: Loop: 458#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 473#L55 assume !parse_expression_list_#t~switch4; 468#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 469#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 474#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 458#L52-4 [2019-11-15 23:24:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2019-11-15 23:24:24,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:24,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873701418] [2019-11-15 23:24:24,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:24,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:24,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873701418] [2019-11-15 23:24:24,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651134357] [2019-11-15 23:24:24,969 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:25,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 23:24:25,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:24:25,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:24:25,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:25,046 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:25,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:24:25,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429343843] [2019-11-15 23:24:25,046 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2019-11-15 23:24:25,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472377237] [2019-11-15 23:24:25,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:25,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:25,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:25,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:25,136 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 23:24:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:25,169 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-15 23:24:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:24:25,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-15 23:24:25,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:25,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-11-15 23:24:25,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:25,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:25,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-11-15 23:24:25,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:25,179 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-15 23:24:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-11-15 23:24:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-15 23:24:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:24:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-11-15 23:24:25,181 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-15 23:24:25,182 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-15 23:24:25,182 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:24:25,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-11-15 23:24:25,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:25,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:25,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:25,183 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-11-15 23:24:25,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:25,184 INFO L791 eck$LassoCheckResult]: Stem: 593#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 578#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 579#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 595#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 596#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 597#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 601#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 605#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 604#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 603#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 602#L79-3 assume !(main_~i~1 < 8); 594#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 572#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 573#L52-4 [2019-11-15 23:24:25,184 INFO L793 eck$LassoCheckResult]: Loop: 573#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 588#L55 assume !parse_expression_list_#t~switch4; 583#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 584#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 589#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 573#L52-4 [2019-11-15 23:24:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2019-11-15 23:24:25,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364068058] [2019-11-15 23:24:25,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:25,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364068058] [2019-11-15 23:24:25,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584899470] [2019-11-15 23:24:25,267 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:25,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:24:25,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:24:25,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:24:25,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:25,355 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:25,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 23:24:25,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545363843] [2019-11-15 23:24:25,358 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:25,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 5 times [2019-11-15 23:24:25,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231685387] [2019-11-15 23:24:25,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:25,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:25,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:24:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:24:25,448 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-15 23:24:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:25,491 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-11-15 23:24:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:24:25,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-15 23:24:25,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:25,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-11-15 23:24:25,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:25,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:25,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-11-15 23:24:25,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:25,497 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-15 23:24:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-11-15 23:24:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-15 23:24:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:24:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-15 23:24:25,500 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-15 23:24:25,500 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-15 23:24:25,500 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:24:25,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-11-15 23:24:25,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:25,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:25,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:25,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-11-15 23:24:25,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:25,507 INFO L791 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 704#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 705#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 721#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 722#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 723#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 727#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 733#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 732#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 731#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 730#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 729#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 728#L79-3 assume !(main_~i~1 < 8); 720#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 698#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 699#L52-4 [2019-11-15 23:24:25,507 INFO L793 eck$LassoCheckResult]: Loop: 699#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 714#L55 assume !parse_expression_list_#t~switch4; 709#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 710#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 715#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 699#L52-4 [2019-11-15 23:24:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2019-11-15 23:24:25,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492523043] [2019-11-15 23:24:25,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:25,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492523043] [2019-11-15 23:24:25,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977086210] [2019-11-15 23:24:25,600 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:25,664 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 23:24:25,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:24:25,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:24:25,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:25,684 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:25,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 23:24:25,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691187386] [2019-11-15 23:24:25,685 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 6 times [2019-11-15 23:24:25,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23893694] [2019-11-15 23:24:25,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:25,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:25,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:24:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:24:25,776 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2019-11-15 23:24:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:25,826 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-11-15 23:24:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:25,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2019-11-15 23:24:25,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:25,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2019-11-15 23:24:25,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:25,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:25,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-15 23:24:25,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:25,830 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 23:24:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-15 23:24:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-15 23:24:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 23:24:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-15 23:24:25,833 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-15 23:24:25,833 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-15 23:24:25,833 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:24:25,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-11-15 23:24:25,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:25,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:25,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:25,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-11-15 23:24:25,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:25,835 INFO L791 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 841#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 842#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 858#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 859#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 860#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 864#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 872#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 871#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 870#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 869#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 868#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 867#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 866#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 865#L79-3 assume !(main_~i~1 < 8); 857#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 835#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 836#L52-4 [2019-11-15 23:24:25,836 INFO L793 eck$LassoCheckResult]: Loop: 836#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 851#L55 assume !parse_expression_list_#t~switch4; 846#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 847#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 852#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 836#L52-4 [2019-11-15 23:24:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2019-11-15 23:24:25,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298135736] [2019-11-15 23:24:25,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:25,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298135736] [2019-11-15 23:24:25,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053004266] [2019-11-15 23:24:25,904 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:25,997 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 23:24:25,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:24:25,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:24:25,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:26,021 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:26,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-15 23:24:26,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005417269] [2019-11-15 23:24:26,021 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 7 times [2019-11-15 23:24:26,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597354643] [2019-11-15 23:24:26,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,030 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:26,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:24:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:24:26,080 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2019-11-15 23:24:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:26,115 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-15 23:24:26,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:26,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-11-15 23:24:26,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:26,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-11-15 23:24:26,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:26,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:26,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-11-15 23:24:26,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:26,120 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-11-15 23:24:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-11-15 23:24:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-15 23:24:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 23:24:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-11-15 23:24:26,123 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-15 23:24:26,123 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-15 23:24:26,123 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:24:26,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2019-11-15 23:24:26,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:26,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:26,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:26,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-11-15 23:24:26,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:26,125 INFO L791 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 989#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 990#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1006#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1007#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1008#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1012#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1022#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1021#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1020#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1019#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1018#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1017#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1016#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1015#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1014#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1013#L79-3 assume !(main_~i~1 < 8); 1005#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 985#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 986#L52-4 [2019-11-15 23:24:26,125 INFO L793 eck$LassoCheckResult]: Loop: 986#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 999#L55 assume !parse_expression_list_#t~switch4; 994#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 995#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1000#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 986#L52-4 [2019-11-15 23:24:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2019-11-15 23:24:26,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477992059] [2019-11-15 23:24:26,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:26,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477992059] [2019-11-15 23:24:26,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444381381] [2019-11-15 23:24:26,200 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:26,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:24:26,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:26,263 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:26,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-15 23:24:26,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614560493] [2019-11-15 23:24:26,264 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 8 times [2019-11-15 23:24:26,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832197351] [2019-11-15 23:24:26,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:26,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:24:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:24:26,329 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-11-15 23:24:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:26,366 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-15 23:24:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:24:26,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-11-15 23:24:26,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:26,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-11-15 23:24:26,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:26,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:26,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-11-15 23:24:26,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:26,370 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-15 23:24:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-11-15 23:24:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-15 23:24:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:24:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-11-15 23:24:26,373 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-15 23:24:26,373 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-15 23:24:26,373 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:24:26,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2019-11-15 23:24:26,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-15 23:24:26,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:26,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:26,375 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-11-15 23:24:26,375 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:26,375 INFO L791 eck$LassoCheckResult]: Stem: 1162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1147#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1148#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1164#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1165#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1166#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1170#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1182#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1181#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1180#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1179#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1178#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1177#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1176#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1175#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1174#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1173#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1172#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1171#L79-3 assume !(main_~i~1 < 8); 1163#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1141#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1142#L52-4 [2019-11-15 23:24:26,375 INFO L793 eck$LassoCheckResult]: Loop: 1142#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1157#L55 assume !parse_expression_list_#t~switch4; 1152#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1153#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1158#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1142#L52-4 [2019-11-15 23:24:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2019-11-15 23:24:26,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641986312] [2019-11-15 23:24:26,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,405 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 9 times [2019-11-15 23:24:26,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186818287] [2019-11-15 23:24:26,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,413 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2019-11-15 23:24:26,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707009246] [2019-11-15 23:24:26,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:31,200 WARN L191 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2019-11-15 23:24:31,437 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-15 23:24:31,439 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:31,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:31,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:31,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:31,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:31,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:31,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:31,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:31,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration10_Lasso [2019-11-15 23:24:31,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:31,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:31,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,636 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-15 23:24:31,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:31,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:32,012 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:24:32,051 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:32,051 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:32,052 INFO L120 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 [2019-11-15 23:24:32,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,054 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,055 INFO L120 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 [2019-11-15 23:24:32,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,056 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,058 INFO L120 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 [2019-11-15 23:24:32,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,060 INFO L120 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 [2019-11-15 23:24:32,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,062 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,062 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,062 INFO L120 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 [2019-11-15 23:24:32,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,065 INFO L120 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 [2019-11-15 23:24:32,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,069 INFO L120 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 [2019-11-15 23:24:32,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,071 INFO L120 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 [2019-11-15 23:24:32,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,074 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,074 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,075 INFO L120 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 [2019-11-15 23:24:32,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,078 INFO L120 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 [2019-11-15 23:24:32,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,081 INFO L120 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 [2019-11-15 23:24:32,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:32,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:32,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:32,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,084 INFO L120 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 [2019-11-15 23:24:32,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,088 INFO L120 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 [2019-11-15 23:24:32,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,090 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,090 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,093 INFO L120 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 [2019-11-15 23:24:32,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,098 INFO L120 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 [2019-11-15 23:24:32,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:32,105 INFO L120 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 [2019-11-15 23:24:32,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:32,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:32,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:32,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:32,109 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:32,109 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:32,122 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:32,131 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:24:32,132 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:24:32,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:32,133 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:32,134 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:32,134 INFO L512 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 [] [2019-11-15 23:24:32,153 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:24:32,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:24:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:32,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:32,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:32,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:32,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:32,232 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 [2019-11-15 23:24:32,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 23:24:32,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 73 states and 92 transitions. Complement of second has 4 states. [2019-11-15 23:24:32,280 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 [2019-11-15 23:24:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2019-11-15 23:24:32,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-15 23:24:32,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:32,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2019-11-15 23:24:32,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:32,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-15 23:24:32,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:32,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2019-11-15 23:24:32,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:32,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2019-11-15 23:24:32,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 23:24:32,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 23:24:32,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2019-11-15 23:24:32,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:32,286 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-11-15 23:24:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2019-11-15 23:24:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-15 23:24:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:24:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-11-15 23:24:32,290 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-15 23:24:32,290 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-15 23:24:32,290 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:24:32,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2019-11-15 23:24:32,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:32,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:32,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:32,292 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:32,292 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:32,292 INFO L791 eck$LassoCheckResult]: Stem: 1413#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1390#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1391#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1415#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1416#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1417#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1435#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1434#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1433#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1432#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1431#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1430#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1429#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1428#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1427#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1426#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1425#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1424#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1423#L79-3 assume !(main_~i~1 < 8); 1414#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1382#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1383#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1406#L55 assume parse_expression_list_#t~switch4; 1394#L56-5 [2019-11-15 23:24:32,293 INFO L793 eck$LassoCheckResult]: Loop: 1394#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1400#L56-1 assume parse_expression_list_#t~short7; 1392#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1394#L56-5 [2019-11-15 23:24:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2019-11-15 23:24:32,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:32,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107558647] [2019-11-15 23:24:32,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2019-11-15 23:24:32,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:32,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092250098] [2019-11-15 23:24:32,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,334 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2019-11-15 23:24:32,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:32,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648561863] [2019-11-15 23:24:32,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:24:32,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648561863] [2019-11-15 23:24:32,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:32,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:32,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006205562] [2019-11-15 23:24:32,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:32,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:32,649 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2019-11-15 23:24:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:32,879 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-11-15 23:24:32,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:24:32,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2019-11-15 23:24:32,881 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 23:24:32,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2019-11-15 23:24:32,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 23:24:32,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 23:24:32,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2019-11-15 23:24:32,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:32,882 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-11-15 23:24:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2019-11-15 23:24:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-11-15 23:24:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 23:24:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-11-15 23:24:32,886 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-15 23:24:32,886 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-15 23:24:32,887 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:24:32,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2019-11-15 23:24:32,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:32,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:32,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:32,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:32,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:32,889 INFO L791 eck$LassoCheckResult]: Stem: 1584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1559#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1560#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1586#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1587#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1588#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1607#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1606#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1605#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1604#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1603#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1602#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1601#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1600#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1598#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1597#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1596#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1595#L79-3 assume !(main_~i~1 < 8); 1585#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1551#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1552#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1573#L55 assume !parse_expression_list_#t~switch4; 1565#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1566#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1576#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1574#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1575#L55 assume parse_expression_list_#t~switch4; 1580#L56-5 [2019-11-15 23:24:32,889 INFO L793 eck$LassoCheckResult]: Loop: 1580#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1581#L56-1 assume parse_expression_list_#t~short7; 1611#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1580#L56-5 [2019-11-15 23:24:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,889 INFO L82 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2019-11-15 23:24:32,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:32,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859158832] [2019-11-15 23:24:32,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,967 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2019-11-15 23:24:32,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:32,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007053152] [2019-11-15 23:24:32,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:32,974 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2019-11-15 23:24:32,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:32,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084729028] [2019-11-15 23:24:32,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:32,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:33,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:39,575 WARN L191 SmtUtils]: Spent 6.46 s on a formula simplification. DAG size of input: 235 DAG size of output: 173 [2019-11-15 23:24:39,928 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 23:24:39,930 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:39,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:39,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:39,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:39,930 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:39,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:39,930 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:39,930 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:39,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2019-11-15 23:24:39,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:39,931 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:39,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:39,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,140 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-15 23:24:40,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:40,532 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:24:40,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:40,612 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:40,612 INFO L120 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 [2019-11-15 23:24:40,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,615 INFO L120 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 [2019-11-15 23:24:40,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,618 INFO L120 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 [2019-11-15 23:24:40,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,621 INFO L120 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 [2019-11-15 23:24:40,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,622 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,622 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,623 INFO L120 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 [2019-11-15 23:24:40,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,626 INFO L120 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 [2019-11-15 23:24:40,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,628 INFO L120 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 [2019-11-15 23:24:40,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,632 INFO L120 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 [2019-11-15 23:24:40,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,634 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,634 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,636 INFO L120 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 [2019-11-15 23:24:40,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:40,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:40,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:40,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,638 INFO L120 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 [2019-11-15 23:24:40,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,640 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,640 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,642 INFO L120 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 [2019-11-15 23:24:40,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,644 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,644 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,646 INFO L120 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 [2019-11-15 23:24:40,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,648 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,648 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,650 INFO L120 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 [2019-11-15 23:24:40,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,652 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,654 INFO L120 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 [2019-11-15 23:24:40,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,659 INFO L120 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 [2019-11-15 23:24:40,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,663 INFO L120 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 [2019-11-15 23:24:40,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,664 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:24:40,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,666 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:24:40,666 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:40,674 INFO L120 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 [2019-11-15 23:24:40,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:40,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:40,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:40,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:40,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:40,677 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:40,685 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:40,695 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:24:40,695 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:24:40,695 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:40,696 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:40,696 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:40,697 INFO L512 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 [] [2019-11-15 23:24:40,725 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 23:24:40,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:24:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:40,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:40,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:40,793 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 [2019-11-15 23:24:40,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 3 states. [2019-11-15 23:24:40,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 176 states and 237 transitions. Complement of second has 7 states. [2019-11-15 23:24:40,862 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 [2019-11-15 23:24:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2019-11-15 23:24:40,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-15 23:24:40,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:40,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2019-11-15 23:24:40,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:40,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2019-11-15 23:24:40,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:40,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2019-11-15 23:24:40,866 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-11-15 23:24:40,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2019-11-15 23:24:40,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-15 23:24:40,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 23:24:40,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2019-11-15 23:24:40,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:40,870 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-11-15 23:24:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2019-11-15 23:24:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-11-15 23:24:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 23:24:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2019-11-15 23:24:40,876 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-11-15 23:24:40,877 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-11-15 23:24:40,877 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:24:40,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2019-11-15 23:24:40,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:40,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:40,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:40,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:40,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:40,879 INFO L791 eck$LassoCheckResult]: Stem: 1976#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1945#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1946#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1978#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1979#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1980#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2001#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2000#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1999#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1998#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1997#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1996#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1995#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1994#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1993#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1992#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1991#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1990#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1989#L79-3 assume !(main_~i~1 < 8); 1977#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1941#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1942#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1959#L55 assume parse_expression_list_#t~switch4; 1968#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1969#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2023#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 2019#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2022#L57 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1983#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1937#L59-8 [2019-11-15 23:24:40,880 INFO L793 eck$LassoCheckResult]: Loop: 1937#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1938#L59-1 assume !parse_expression_list_#t~short14; 1955#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1937#L59-8 [2019-11-15 23:24:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2019-11-15 23:24:40,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:40,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564995147] [2019-11-15 23:24:40,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:40,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:40,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:24:41,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564995147] [2019-11-15 23:24:41,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:41,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:24:41,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990864549] [2019-11-15 23:24:41,159 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2019-11-15 23:24:41,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038948581] [2019-11-15 23:24:41,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:41,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038948581] [2019-11-15 23:24:41,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:41,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:41,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760801424] [2019-11-15 23:24:41,174 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:24:41,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:41,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:41,174 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-11-15 23:24:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:41,186 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-11-15 23:24:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:41,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2019-11-15 23:24:41,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:41,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2019-11-15 23:24:41,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 23:24:41,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 23:24:41,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2019-11-15 23:24:41,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:41,190 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-15 23:24:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2019-11-15 23:24:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-15 23:24:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 23:24:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2019-11-15 23:24:41,194 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-15 23:24:41,194 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-15 23:24:41,199 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:24:41,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2019-11-15 23:24:41,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:41,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:41,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:41,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:41,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:41,204 INFO L791 eck$LassoCheckResult]: Stem: 2173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2141#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2142#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2175#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2176#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2177#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2220#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2219#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2218#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2217#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2216#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2215#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2213#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2212#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2211#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2210#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2209#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2208#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2207#L79-3 assume !(main_~i~1 < 8); 2174#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2133#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2134#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2156#L55 assume parse_expression_list_#t~switch4; 2201#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2150#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2143#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 2144#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2160#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2178#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2135#L59-8 [2019-11-15 23:24:41,204 INFO L793 eck$LassoCheckResult]: Loop: 2135#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2136#L59-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 2153#L59-2 assume parse_expression_list_#t~short13; 2180#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2172#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 2135#L59-8 [2019-11-15 23:24:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2019-11-15 23:24:41,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363191379] [2019-11-15 23:24:41,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,267 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2019-11-15 23:24:41,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124795486] [2019-11-15 23:24:41,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,284 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2019-11-15 23:24:41,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48324580] [2019-11-15 23:24:41,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:24:41,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48324580] [2019-11-15 23:24:41,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:41,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:24:41,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713068178] [2019-11-15 23:24:41,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:24:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:24:41,440 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 6 states. [2019-11-15 23:24:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:41,533 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2019-11-15 23:24:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:24:41,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 182 transitions. [2019-11-15 23:24:41,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 23:24:41,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 131 states and 169 transitions. [2019-11-15 23:24:41,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:24:41,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:24:41,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2019-11-15 23:24:41,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:41,537 INFO L688 BuchiCegarLoop]: Abstraction has 131 states and 169 transitions. [2019-11-15 23:24:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2019-11-15 23:24:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2019-11-15 23:24:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:24:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-11-15 23:24:41,541 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-15 23:24:41,541 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-15 23:24:41,541 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 23:24:41,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 124 transitions. [2019-11-15 23:24:41,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:41,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:41,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:41,543 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:41,543 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:41,543 INFO L791 eck$LassoCheckResult]: Stem: 2419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2393#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2394#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2421#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2422#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2423#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2457#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2456#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2455#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2454#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2453#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2452#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2451#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2450#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2449#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2448#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2447#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2446#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2445#L79-3 assume !(main_~i~1 < 8); 2420#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2389#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2390#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2408#L55 assume !parse_expression_list_#t~switch4; 2444#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2476#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2475#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2468#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2466#L55 assume parse_expression_list_#t~switch4; 2463#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2460#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2395#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 2396#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2430#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2424#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2385#L59-8 [2019-11-15 23:24:41,543 INFO L793 eck$LassoCheckResult]: Loop: 2385#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2386#L59-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 2405#L59-2 assume parse_expression_list_#t~short13; 2426#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2418#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 2385#L59-8 [2019-11-15 23:24:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2019-11-15 23:24:41,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018251595] [2019-11-15 23:24:41,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,577 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2019-11-15 23:24:41,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112423929] [2019-11-15 23:24:41,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,584 INFO L82 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2019-11-15 23:24:41,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344129524] [2019-11-15 23:24:41,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:24:41,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344129524] [2019-11-15 23:24:41,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190479017] [2019-11-15 23:24:41,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:41,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:24:41,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:41,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:24:41,741 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:41,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 23:24:41,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208146120] [2019-11-15 23:24:41,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:41,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:41,819 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-11-15 23:24:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:41,945 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2019-11-15 23:24:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:41,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 244 transitions. [2019-11-15 23:24:41,947 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-15 23:24:41,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 171 states and 222 transitions. [2019-11-15 23:24:41,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 23:24:41,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-15 23:24:41,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 222 transitions. [2019-11-15 23:24:41,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:41,949 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2019-11-15 23:24:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 222 transitions. [2019-11-15 23:24:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2019-11-15 23:24:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 23:24:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2019-11-15 23:24:41,954 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-11-15 23:24:41,954 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-11-15 23:24:41,954 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-15 23:24:41,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2019-11-15 23:24:41,955 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 23:24:41,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:41,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:41,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:41,956 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:41,956 INFO L791 eck$LassoCheckResult]: Stem: 2837#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2811#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2812#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2839#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2840#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2841#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2851#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2867#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2866#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2865#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2864#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2863#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2862#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2861#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2860#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2859#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2858#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2857#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2856#L79-3 assume !(main_~i~1 < 8); 2838#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2803#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2804#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2825#L55 assume !parse_expression_list_#t~switch4; 2918#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2922#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2921#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2920#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2917#L55 assume !parse_expression_list_#t~switch4; 2912#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2934#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2933#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2916#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2911#L55 assume parse_expression_list_#t~switch4; 2907#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2901#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2897#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 2895#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2891#L57 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 2844#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2805#L59-8 [2019-11-15 23:24:41,956 INFO L793 eck$LassoCheckResult]: Loop: 2805#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2806#L59-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 2822#L59-2 assume parse_expression_list_#t~short13; 2847#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2836#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 2805#L59-8 [2019-11-15 23:24:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2019-11-15 23:24:41,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680551568] [2019-11-15 23:24:41,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2019-11-15 23:24:41,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170745485] [2019-11-15 23:24:41,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:42,000 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2019-11-15 23:24:42,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:42,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54248332] [2019-11-15 23:24:42,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:42,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:42,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:42,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:51,069 WARN L191 SmtUtils]: Spent 8.95 s on a formula simplification. DAG size of input: 290 DAG size of output: 203 [2019-11-15 23:24:51,400 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 23:24:51,402 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:51,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:51,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:51,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:51,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:51,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:51,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:51,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:51,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration16_Lasso [2019-11-15 23:24:51,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:51,402 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:51,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,635 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 23:24:51,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:51,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:52,128 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:24:52,146 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:52,146 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:52,147 INFO L120 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 [2019-11-15 23:24:52,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,155 INFO L120 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 [2019-11-15 23:24:52,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,158 INFO L120 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 [2019-11-15 23:24:52,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,161 INFO L120 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 [2019-11-15 23:24:52,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,171 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,171 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,172 INFO L120 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 [2019-11-15 23:24:52,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,175 INFO L120 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 [2019-11-15 23:24:52,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,184 INFO L120 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 [2019-11-15 23:24:52,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,186 INFO L120 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 [2019-11-15 23:24:52,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,189 INFO L120 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 [2019-11-15 23:24:52,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,190 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,191 INFO L120 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 [2019-11-15 23:24:52,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,194 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,195 INFO L120 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 [2019-11-15 23:24:52,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,199 INFO L120 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 [2019-11-15 23:24:52,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,201 INFO L120 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 [2019-11-15 23:24:52,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,203 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,203 INFO L120 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 [2019-11-15 23:24:52,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,205 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,207 INFO L120 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 [2019-11-15 23:24:52,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,209 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,209 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,210 INFO L120 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 [2019-11-15 23:24:52,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:52,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:52,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:52,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,213 INFO L120 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 [2019-11-15 23:24:52,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,217 INFO L120 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 [2019-11-15 23:24:52,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,220 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,220 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,222 INFO L120 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 [2019-11-15 23:24:52,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,224 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,224 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,226 INFO L120 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 [2019-11-15 23:24:52,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,226 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:24:52,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,234 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:24:52,234 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:52,238 INFO L120 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 [2019-11-15 23:24:52,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:52,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:52,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:52,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:52,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:52,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:52,268 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:52,288 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:24:52,289 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:24:52,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:52,290 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:52,290 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:52,291 INFO L512 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 [] [2019-11-15 23:24:52,320 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 23:24:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:52,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:52,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:52,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:24:52,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:52,429 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 [2019-11-15 23:24:52,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 4 states. [2019-11-15 23:24:52,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51. Second operand 4 states. Result 296 states and 391 transitions. Complement of second has 11 states. [2019-11-15 23:24:52,567 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 [2019-11-15 23:24:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:24:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2019-11-15 23:24:52,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2019-11-15 23:24:52,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:52,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2019-11-15 23:24:52,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:52,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2019-11-15 23:24:52,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:52,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 391 transitions. [2019-11-15 23:24:52,570 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-11-15 23:24:52,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 196 states and 256 transitions. [2019-11-15 23:24:52,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-15 23:24:52,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-15 23:24:52,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 256 transitions. [2019-11-15 23:24:52,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:52,573 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 256 transitions. [2019-11-15 23:24:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 256 transitions. [2019-11-15 23:24:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2019-11-15 23:24:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 23:24:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2019-11-15 23:24:52,578 INFO L711 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-11-15 23:24:52,578 INFO L591 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-11-15 23:24:52,578 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-15 23:24:52,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 184 transitions. [2019-11-15 23:24:52,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 23:24:52,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:52,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:52,580 INFO L849 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, 1] [2019-11-15 23:24:52,580 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:52,581 INFO L791 eck$LassoCheckResult]: Stem: 3468#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3444#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3445#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3470#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3471#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3472#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3493#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3492#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3491#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3490#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3489#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3488#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3487#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3486#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3485#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3484#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3483#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3482#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3481#L79-3 assume !(main_~i~1 < 8); 3469#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 3436#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3437#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3456#L55 assume parse_expression_list_#t~switch4; 3529#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3561#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 3559#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 3557#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3556#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 3554#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3553#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3552#L59-1 assume !parse_expression_list_#t~short14; 3551#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 3550#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3549#L60 assume !parse_expression_list_#t~short17; 3548#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3547#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3546#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 3545#L31 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3544#L4 assume !(0 == __VERIFIER_assert_~cond); 3543#L4-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); 3542#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3541#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3540#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3539#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3538#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3537#L55 assume parse_expression_list_#t~switch4; 3447#L56-5 [2019-11-15 23:24:52,581 INFO L793 eck$LassoCheckResult]: Loop: 3447#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3452#L56-1 assume parse_expression_list_#t~short7; 3446#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 3447#L56-5 [2019-11-15 23:24:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2019-11-15 23:24:52,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:52,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462769296] [2019-11-15 23:24:52,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:52,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:52,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:24:52,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462769296] [2019-11-15 23:24:52,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:52,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:52,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061388863] [2019-11-15 23:24:52,678 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2019-11-15 23:24:52,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:52,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118689682] [2019-11-15 23:24:52,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:52,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:52,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:52,684 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:52,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:52,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:52,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:52,742 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. cyclomatic complexity: 52 Second operand 7 states. [2019-11-15 23:24:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:52,930 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2019-11-15 23:24:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:24:52,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 159 transitions. [2019-11-15 23:24:52,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:52,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 107 states and 139 transitions. [2019-11-15 23:24:52,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 23:24:52,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:24:52,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 139 transitions. [2019-11-15 23:24:52,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:52,934 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-15 23:24:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 139 transitions. [2019-11-15 23:24:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-15 23:24:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:24:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-11-15 23:24:52,936 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-15 23:24:52,936 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-15 23:24:52,937 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-15 23:24:52,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2019-11-15 23:24:52,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:52,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:52,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:52,938 INFO L849 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, 1] [2019-11-15 23:24:52,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:52,939 INFO L791 eck$LassoCheckResult]: Stem: 3753#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3727#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3728#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3755#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3756#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3757#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3764#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3787#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3785#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3782#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3779#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3778#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3777#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3776#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3774#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3772#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3770#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3767#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3766#L79-3 assume !(main_~i~1 < 8); 3754#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 3719#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3720#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3740#L55 assume !parse_expression_list_#t~switch4; 3734#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3735#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3743#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3741#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3742#L55 assume parse_expression_list_#t~switch4; 3748#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3749#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 3820#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 3821#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3819#L57 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 3759#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3723#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3724#L59-1 assume !parse_expression_list_#t~short14; 3739#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 3752#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3784#L60 assume !parse_expression_list_#t~short17; 3781#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3716#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3725#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 3726#L31 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3750#L4 assume !(0 == __VERIFIER_assert_~cond); 3763#L4-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); 3746#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3747#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3775#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3773#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3771#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3768#L55 assume parse_expression_list_#t~switch4; 3731#L56-5 [2019-11-15 23:24:52,939 INFO L793 eck$LassoCheckResult]: Loop: 3731#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3736#L56-1 assume parse_expression_list_#t~short7; 3729#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 3731#L56-5 [2019-11-15 23:24:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -70433790, now seen corresponding path program 1 times [2019-11-15 23:24:52,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:52,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831360955] [2019-11-15 23:24:52,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:52,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:52,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 23:24:53,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831360955] [2019-11-15 23:24:53,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:53,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:24:53,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397593395] [2019-11-15 23:24:53,063 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2019-11-15 23:24:53,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:53,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005985995] [2019-11-15 23:24:53,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:53,068 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:53,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:53,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:24:53,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:24:53,128 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 9 states. [2019-11-15 23:24:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:53,432 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2019-11-15 23:24:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:24:53,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 240 transitions. [2019-11-15 23:24:53,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 23:24:53,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 159 states and 209 transitions. [2019-11-15 23:24:53,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 23:24:53,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 23:24:53,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 209 transitions. [2019-11-15 23:24:53,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:24:53,437 INFO L688 BuchiCegarLoop]: Abstraction has 159 states and 209 transitions. [2019-11-15 23:24:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 209 transitions. [2019-11-15 23:24:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2019-11-15 23:24:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:24:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2019-11-15 23:24:53,440 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 165 transitions. [2019-11-15 23:24:53,440 INFO L591 BuchiCegarLoop]: Abstraction has 126 states and 165 transitions. [2019-11-15 23:24:53,441 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-15 23:24:53,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 165 transitions. [2019-11-15 23:24:53,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:24:53,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:53,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:53,445 INFO L849 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, 1] [2019-11-15 23:24:53,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:53,445 INFO L791 eck$LassoCheckResult]: Stem: 4068#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4041#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 4042#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4070#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4071#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4072#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4092#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4091#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4090#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4089#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4088#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4087#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4086#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4085#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4084#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4083#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4082#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4081#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4080#L79-3 assume !(main_~i~1 < 8); 4069#L79-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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 4033#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4034#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 4054#L55 assume !parse_expression_list_#t~switch4; 4122#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 4121#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4120#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4055#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 4056#L55 assume parse_expression_list_#t~switch4; 4063#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 4051#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 4046#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5; 4047#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4060#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 4074#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4037#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 4038#L59-1 assume !parse_expression_list_#t~short14; 4053#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 4101#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4100#L60 assume !parse_expression_list_#t~short17; 4099#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 4029#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4039#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 4040#L31 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4064#L4 assume !(0 == __VERIFIER_assert_~cond); 4078#L4-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); 4061#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4062#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 4097#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4096#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4095#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 4093#L55 assume parse_expression_list_#t~switch4; 4045#L56-5 [2019-11-15 23:24:53,445 INFO L793 eck$LassoCheckResult]: Loop: 4045#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 4050#L56-1 assume parse_expression_list_#t~short7; 4043#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 4045#L56-5 [2019-11-15 23:24:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2019-11-15 23:24:53,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:53,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244816016] [2019-11-15 23:24:53,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 23:24:53,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244816016] [2019-11-15 23:24:53,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536021895] [2019-11-15 23:24:53,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0401a4fe-f466-44ee-813a-906bb137169c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:53,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:24:53,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:53,732 INFO L375 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 [2019-11-15 23:24:53,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:24:53,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,756 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:24:53,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 23:24:53,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-15 23:24:53,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,816 INFO L496 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. [2019-11-15 23:24:53,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2019-11-15 23:24:53,866 INFO L375 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 10 [2019-11-15 23:24:53,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2019-11-15 23:24:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 23:24:53,883 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:53,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-15 23:24:53,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558744097] [2019-11-15 23:24:53,884 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:24:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2019-11-15 23:24:53,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:53,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975032002] [2019-11-15 23:24:53,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:53,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:53,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:24:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:24:53,945 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. cyclomatic complexity: 47 Second operand 10 states. [2019-11-15 23:24:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:54,159 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-15 23:24:54,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:54,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 112 transitions. [2019-11-15 23:24:54,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:24:54,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2019-11-15 23:24:54,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:24:54,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:24:54,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:24:54,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:54,161 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:54,161 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:54,161 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:54,161 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-15 23:24:54,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:24:54,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:24:54,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:24:54,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:24:54 BoogieIcfgContainer [2019-11-15 23:24:54,168 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:24:54,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:24:54,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:24:54,169 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:24:54,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:22" (3/4) ... [2019-11-15 23:24:54,172 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:24:54,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:24:54,173 INFO L168 Benchmark]: Toolchain (without parser) took 32105.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 941.1 MB in the beginning and 972.9 MB in the end (delta: -31.8 MB). Peak memory consumption was 296.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:54,174 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:54,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:54,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.50 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:54,175 INFO L168 Benchmark]: Boogie Preprocessor took 29.81 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. [2019-11-15 23:24:54,175 INFO L168 Benchmark]: RCFGBuilder took 438.44 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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:54,176 INFO L168 Benchmark]: BuchiAutomizer took 31223.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 972.9 MB in the end (delta: 130.3 MB). Peak memory consumption was 308.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:54,176 INFO L168 Benchmark]: Witness Printer took 4.06 ms. Allocated memory is still 1.4 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:54,178 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.50 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.81 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 438.44 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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31223.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 972.9 MB in the end (delta: 130.3 MB). Peak memory consumption was 308.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.06 ms. Allocated memory is still 1.4 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (15 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. 15 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.1s and 20 iterations. TraceHistogramMax:8. Analysis of lassos took 28.7s. Construction of modules took 0.9s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 236 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 142 states and ocurred in iteration 16. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 707 SDtfs, 936 SDslu, 2018 SDs, 0 SdLazy, 789 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU11 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax100 hnf100 lsp92 ukn56 mio100 lsp47 div100 bol100 ite100 ukn100 eq181 hnf88 smp100 dnf142 smp96 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...