./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 5826109f3da002ef221ffbad3510db88b48ab8f7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:04:48,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:04:48,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:04:48,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:04:48,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:04:48,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:04:48,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:04:48,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:04:48,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:04:48,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:04:48,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:04:48,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:04:48,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:04:48,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:04:48,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:04:48,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:04:48,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:04:48,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:04:48,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:04:48,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:04:48,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:04:48,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:04:48,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:04:48,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:04:48,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:04:48,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:04:48,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:04:48,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:04:48,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:04:48,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:04:48,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:04:48,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:04:48,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:04:48,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:04:48,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:04:48,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:04:48,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:04:48,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:04:48,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:04:48,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:04:48,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:04:48,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:04:48,701 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:04:48,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:04:48,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:04:48,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:04:48,705 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:04:48,705 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:04:48,705 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:04:48,705 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:04:48,706 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:04:48,706 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:04:48,707 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:04:48,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:04:48,708 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:04:48,709 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:04:48,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:04:48,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:04:48,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:04:48,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:04:48,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:04:48,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:04:48,710 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:04:48,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:04:48,711 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:04:48,711 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:04:48,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:04:48,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:04:48,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:04:48,712 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:04:48,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:04:48,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:04:48,713 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:04:48,714 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:04:48,715 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:04:48,715 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 5826109f3da002ef221ffbad3510db88b48ab8f7 [2020-10-20 07:04:49,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:04:49,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:04:49,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:04:49,023 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:04:49,023 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:04:49,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-10-20 07:04:49,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4207850/c0df12fb5018485ca70ae40333d6d48f/FLAG9244cdfa5 [2020-10-20 07:04:49,645 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:04:49,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-10-20 07:04:49,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4207850/c0df12fb5018485ca70ae40333d6d48f/FLAG9244cdfa5 [2020-10-20 07:04:49,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4207850/c0df12fb5018485ca70ae40333d6d48f [2020-10-20 07:04:49,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:04:49,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:04:49,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:04:49,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:04:49,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:04:49,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:04:49" (1/1) ... [2020-10-20 07:04:49,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab99eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:49, skipping insertion in model container [2020-10-20 07:04:49,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:04:49" (1/1) ... [2020-10-20 07:04:49,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:04:49,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:04:50,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:04:50,301 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:04:50,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:04:50,381 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:04:50,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50 WrapperNode [2020-10-20 07:04:50,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:04:50,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:04:50,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:04:50,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:04:50,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:04:50,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:04:50,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:04:50,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:04:50,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... [2020-10-20 07:04:50,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:04:50,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:04:50,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:04:50,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:04:50,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:04:50,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:04:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:04:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:04:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:04:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-10-20 07:04:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:04:50,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:04:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:04:51,027 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:04:51,027 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-10-20 07:04:51,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:04:51 BoogieIcfgContainer [2020-10-20 07:04:51,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:04:51,030 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:04:51,030 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:04:51,034 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:04:51,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:04:51,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:04:49" (1/3) ... [2020-10-20 07:04:51,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66ef47c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:04:51, skipping insertion in model container [2020-10-20 07:04:51,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:04:51,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:50" (2/3) ... [2020-10-20 07:04:51,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66ef47c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:04:51, skipping insertion in model container [2020-10-20 07:04:51,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:04:51,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:04:51" (3/3) ... [2020-10-20 07:04:51,041 INFO L373 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-10-20 07:04:51,100 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:04:51,100 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:04:51,100 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:04:51,101 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:04:51,101 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:04:51,101 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:04:51,101 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:04:51,101 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:04:51,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-10-20 07:04:51,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2020-10-20 07:04:51,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:51,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:51,151 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:04:51,151 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:04:51,151 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:04:51,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-10-20 07:04:51,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2020-10-20 07:04:51,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:51,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:51,156 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:04:51,156 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:04:51,163 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 10#L-1true havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 34#L90-3true [2020-10-20 07:04:51,163 INFO L796 eck$LassoCheckResult]: Loop: 34#L90-3true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 39#L90-2true main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 34#L90-3true [2020-10-20 07:04:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:04:51,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:51,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615034181] [2020-10-20 07:04:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:51,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:51,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:51,344 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 07:04:51,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:51,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256520092] [2020-10-20 07:04:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:51,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:51,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:51,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:51,368 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 07:04:51,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:51,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584700953] [2020-10-20 07:04:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:51,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:51,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:51,450 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:51,795 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-20 07:04:51,914 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:04:51,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:04:51,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:04:51,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:04:51,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:04:51,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:51,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:04:51,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:04:51,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2020-10-20 07:04:51,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:04:51,917 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:04:51,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:52,439 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:04:52,444 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:52,457 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 [2020-10-20 07:04:52,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:52,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:52,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:52,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:52,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:52,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:52,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:52,539 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 [2020-10-20 07:04:52,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:52,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:52,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:52,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:52,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:52,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:52,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:52,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 [2020-10-20 07:04:52,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:52,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:52,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:52,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:52,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:52,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:52,658 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:04:52,714 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 07:04:52,714 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:52,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:52,734 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:04:52,734 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:04:52,735 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_main_~i~1) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 2*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-20 07:04:52,808 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 07:04:52,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:04:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:52,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:52,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:52,903 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:04:52,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:52,969 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 [2020-10-20 07:04:52,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states. Second operand 3 states. [2020-10-20 07:04:53,194 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states.. Second operand 3 states. Result 106 states and 159 transitions. Complement of second has 8 states. [2020-10-20 07:04:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:04:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2020-10-20 07:04:53,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 07:04:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 07:04:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 07:04:53,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:53,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 159 transitions. [2020-10-20 07:04:53,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:53,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 32 states and 43 transitions. [2020-10-20 07:04:53,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 07:04:53,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:53,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2020-10-20 07:04:53,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:53,248 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-20 07:04:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2020-10-20 07:04:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-20 07:04:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 07:04:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-20 07:04:53,293 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-20 07:04:53,293 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-20 07:04:53,293 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:04:53,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-10-20 07:04:53,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:53,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:53,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:53,303 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:53,303 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:53,304 INFO L794 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 223#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 224#L90-3 assume !(main_~i~1 < 8); 240#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 219#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 220#L63-4 [2020-10-20 07:04:53,304 INFO L796 eck$LassoCheckResult]: Loop: 220#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 235#L66 assume !parse_expression_list_#t~switch7; 228#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 229#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 236#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 220#L63-4 [2020-10-20 07:04:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:53,305 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2020-10-20 07:04:53,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:53,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647801353] [2020-10-20 07:04:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:53,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647801353] [2020-10-20 07:04:53,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:04:53,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 07:04:53,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379803784] [2020-10-20 07:04:53,440 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 1 times [2020-10-20 07:04:53,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:53,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153711620] [2020-10-20 07:04:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:53,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:53,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:53,485 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:53,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:04:53,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:04:53,579 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 07:04:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:53,601 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-10-20 07:04:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:04:53,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-10-20 07:04:53,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:53,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2020-10-20 07:04:53,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:53,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:53,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2020-10-20 07:04:53,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:53,612 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-10-20 07:04:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2020-10-20 07:04:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-10-20 07:04:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 07:04:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-10-20 07:04:53,622 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 07:04:53,622 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 07:04:53,623 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:04:53,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-10-20 07:04:53,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:53,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:53,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:53,628 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:53,628 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:53,628 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 294#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 295#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 312#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 313#L90-3 assume !(main_~i~1 < 8); 311#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 288#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 289#L63-4 [2020-10-20 07:04:53,629 INFO L796 eck$LassoCheckResult]: Loop: 289#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 306#L66 assume !parse_expression_list_#t~switch7; 299#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 300#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 307#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 289#L63-4 [2020-10-20 07:04:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2020-10-20 07:04:53,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:53,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398380642] [2020-10-20 07:04:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:53,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398380642] [2020-10-20 07:04:53,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217653657] [2020-10-20 07:04:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:04:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:53,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 07:04:53,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:53,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:53,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 07:04:53,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654698174] [2020-10-20 07:04:53,760 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 2 times [2020-10-20 07:04:53,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:53,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315751748] [2020-10-20 07:04:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:53,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:53,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:53,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:53,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:04:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:04:53,835 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 07:04:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:53,861 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-10-20 07:04:53,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:04:53,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2020-10-20 07:04:53,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:53,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2020-10-20 07:04:53,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:53,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:53,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2020-10-20 07:04:53,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:53,872 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 07:04:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2020-10-20 07:04:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-10-20 07:04:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 07:04:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-20 07:04:53,881 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 07:04:53,881 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 07:04:53,881 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:04:53,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-10-20 07:04:53,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:53,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:53,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:53,884 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:04:53,884 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:53,885 INFO L794 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 387#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 388#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 405#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 406#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 407#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 410#L90-3 assume !(main_~i~1 < 8); 404#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 381#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 382#L63-4 [2020-10-20 07:04:53,885 INFO L796 eck$LassoCheckResult]: Loop: 382#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 399#L66 assume !parse_expression_list_#t~switch7; 392#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 393#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 400#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 382#L63-4 [2020-10-20 07:04:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2020-10-20 07:04:53,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:53,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424116030] [2020-10-20 07:04:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:53,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424116030] [2020-10-20 07:04:53,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316207880] [2020-10-20 07:04:53,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:04:54,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:04:54,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:54,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:04:54,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:54,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 07:04:54,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868798182] [2020-10-20 07:04:54,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 3 times [2020-10-20 07:04:54,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919694474] [2020-10-20 07:04:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:54,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:54,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:04:54,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:04:54,097 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-20 07:04:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:54,119 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-10-20 07:04:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:04:54,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-10-20 07:04:54,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2020-10-20 07:04:54,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:54,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:54,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2020-10-20 07:04:54,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:54,123 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2020-10-20 07:04:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2020-10-20 07:04:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-10-20 07:04:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 07:04:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-10-20 07:04:54,128 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-20 07:04:54,128 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-20 07:04:54,128 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:04:54,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2020-10-20 07:04:54,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:54,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:54,130 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-10-20 07:04:54,130 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:54,130 INFO L794 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 491#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 492#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 509#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 514#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 516#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 510#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 511#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 515#L90-3 assume !(main_~i~1 < 8); 508#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 485#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 486#L63-4 [2020-10-20 07:04:54,131 INFO L796 eck$LassoCheckResult]: Loop: 486#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 503#L66 assume !parse_expression_list_#t~switch7; 496#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 497#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 504#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 486#L63-4 [2020-10-20 07:04:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2020-10-20 07:04:54,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173962795] [2020-10-20 07:04:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173962795] [2020-10-20 07:04:54,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545404092] [2020-10-20 07:04:54,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:04:54,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 07:04:54,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:54,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:04:54,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:54,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 07:04:54,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100524178] [2020-10-20 07:04:54,314 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 4 times [2020-10-20 07:04:54,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524529700] [2020-10-20 07:04:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,342 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:54,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:04:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:04:54,401 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-20 07:04:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:54,449 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-10-20 07:04:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:04:54,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-10-20 07:04:54,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2020-10-20 07:04:54,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:54,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:54,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2020-10-20 07:04:54,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:54,457 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-10-20 07:04:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2020-10-20 07:04:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-10-20 07:04:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 07:04:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2020-10-20 07:04:54,464 INFO L714 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-10-20 07:04:54,464 INFO L594 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-10-20 07:04:54,464 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:04:54,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2020-10-20 07:04:54,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:54,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:54,466 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2020-10-20 07:04:54,466 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:54,466 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 606#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 607#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 624#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 625#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 626#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 629#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 633#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 632#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 631#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 630#L90-3 assume !(main_~i~1 < 8); 623#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 602#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 603#L63-4 [2020-10-20 07:04:54,466 INFO L796 eck$LassoCheckResult]: Loop: 603#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 618#L66 assume !parse_expression_list_#t~switch7; 611#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 612#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 619#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 603#L63-4 [2020-10-20 07:04:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2020-10-20 07:04:54,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369465304] [2020-10-20 07:04:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369465304] [2020-10-20 07:04:54,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018602029] [2020-10-20 07:04:54,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:04:54,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 07:04:54,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:54,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:04:54,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:54,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 07:04:54,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43921071] [2020-10-20 07:04:54,593 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 5 times [2020-10-20 07:04:54,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630317129] [2020-10-20 07:04:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,604 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:54,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:04:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:04:54,682 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-20 07:04:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:54,722 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-10-20 07:04:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:04:54,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2020-10-20 07:04:54,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2020-10-20 07:04:54,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:54,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:54,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2020-10-20 07:04:54,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:54,726 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-10-20 07:04:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2020-10-20 07:04:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-10-20 07:04:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 07:04:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2020-10-20 07:04:54,730 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-10-20 07:04:54,730 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-10-20 07:04:54,730 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:04:54,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2020-10-20 07:04:54,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:54,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:54,732 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2020-10-20 07:04:54,733 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:54,733 INFO L794 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 732#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 733#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 750#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 751#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 752#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 755#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 761#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 760#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 759#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 758#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 757#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 756#L90-3 assume !(main_~i~1 < 8); 749#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 728#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 729#L63-4 [2020-10-20 07:04:54,733 INFO L796 eck$LassoCheckResult]: Loop: 729#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 744#L66 assume !parse_expression_list_#t~switch7; 737#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 738#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 745#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 729#L63-4 [2020-10-20 07:04:54,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2020-10-20 07:04:54,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315686349] [2020-10-20 07:04:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315686349] [2020-10-20 07:04:54,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468135510] [2020-10-20 07:04:54,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:04:54,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 07:04:54,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:54,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:04:54,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:54,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:54,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 07:04:54,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698288043] [2020-10-20 07:04:54,882 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 6 times [2020-10-20 07:04:54,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:54,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401960692] [2020-10-20 07:04:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:54,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:54,894 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:54,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 07:04:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 07:04:54,960 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-10-20 07:04:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:54,995 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-10-20 07:04:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:04:54,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2020-10-20 07:04:54,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:54,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2020-10-20 07:04:54,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:54,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:54,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-10-20 07:04:54,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:54,999 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-20 07:04:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-10-20 07:04:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-10-20 07:04:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 07:04:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2020-10-20 07:04:55,003 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2020-10-20 07:04:55,003 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2020-10-20 07:04:55,003 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:04:55,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2020-10-20 07:04:55,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:55,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:55,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:55,005 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2020-10-20 07:04:55,006 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:55,006 INFO L794 eck$LassoCheckResult]: Stem: 885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 869#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 870#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 887#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 888#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 889#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 892#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 900#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 899#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 898#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 897#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 896#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 895#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 894#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 893#L90-3 assume !(main_~i~1 < 8); 886#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 863#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 864#L63-4 [2020-10-20 07:04:55,006 INFO L796 eck$LassoCheckResult]: Loop: 864#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 881#L66 assume !parse_expression_list_#t~switch7; 874#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 875#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 882#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 864#L63-4 [2020-10-20 07:04:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2020-10-20 07:04:55,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064229109] [2020-10-20 07:04:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:55,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064229109] [2020-10-20 07:04:55,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643229414] [2020-10-20 07:04:55,089 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:55,183 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 07:04:55,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:55,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 07:04:55,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:55,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:55,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 07:04:55,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879035213] [2020-10-20 07:04:55,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 7 times [2020-10-20 07:04:55,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400499477] [2020-10-20 07:04:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,254 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:55,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:55,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 07:04:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 07:04:55,334 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-20 07:04:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:55,372 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-10-20 07:04:55,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:04:55,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2020-10-20 07:04:55,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:55,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2020-10-20 07:04:55,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:55,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:55,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-10-20 07:04:55,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:55,376 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-10-20 07:04:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-10-20 07:04:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2020-10-20 07:04:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 07:04:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2020-10-20 07:04:55,380 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2020-10-20 07:04:55,380 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2020-10-20 07:04:55,380 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 07:04:55,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2020-10-20 07:04:55,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:55,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:55,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:55,382 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2020-10-20 07:04:55,382 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:55,382 INFO L794 eck$LassoCheckResult]: Stem: 1033#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1017#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1018#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1035#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1036#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1037#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1040#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1050#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1049#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1048#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1047#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1046#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1045#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1044#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1043#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1042#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1041#L90-3 assume !(main_~i~1 < 8); 1034#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1011#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1012#L63-4 [2020-10-20 07:04:55,383 INFO L796 eck$LassoCheckResult]: Loop: 1012#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1029#L66 assume !parse_expression_list_#t~switch7; 1022#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 1023#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1030#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1012#L63-4 [2020-10-20 07:04:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2020-10-20 07:04:55,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094221241] [2020-10-20 07:04:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:55,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094221241] [2020-10-20 07:04:55,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744916362] [2020-10-20 07:04:55,461 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:55,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:04:55,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:55,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:55,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 07:04:55,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390688214] [2020-10-20 07:04:55,535 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,535 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 8 times [2020-10-20 07:04:55,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109642615] [2020-10-20 07:04:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,545 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:55,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 07:04:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 07:04:55,617 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-10-20 07:04:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:55,661 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-10-20 07:04:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 07:04:55,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2020-10-20 07:04:55,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:55,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2020-10-20 07:04:55,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:04:55,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:04:55,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2020-10-20 07:04:55,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:55,668 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-20 07:04:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2020-10-20 07:04:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-20 07:04:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-20 07:04:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2020-10-20 07:04:55,672 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-20 07:04:55,672 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-20 07:04:55,672 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 07:04:55,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2020-10-20 07:04:55,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 07:04:55,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:55,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:55,674 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2020-10-20 07:04:55,674 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:55,674 INFO L794 eck$LassoCheckResult]: Stem: 1191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1175#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1176#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1193#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1194#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1195#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1198#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1210#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1209#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1208#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1207#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1206#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1205#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1204#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1203#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1202#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1201#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1200#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1199#L90-3 assume !(main_~i~1 < 8); 1192#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1169#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1170#L63-4 [2020-10-20 07:04:55,675 INFO L796 eck$LassoCheckResult]: Loop: 1170#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1187#L66 assume !parse_expression_list_#t~switch7; 1180#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 1181#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1188#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1170#L63-4 [2020-10-20 07:04:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2020-10-20 07:04:55,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078046056] [2020-10-20 07:04:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,716 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:55,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 9 times [2020-10-20 07:04:55,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763970146] [2020-10-20 07:04:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,725 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 299274822, now seen corresponding path program 1 times [2020-10-20 07:04:55,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:55,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884278282] [2020-10-20 07:04:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:55,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:55,784 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:01,049 WARN L193 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 224 DAG size of output: 172 [2020-10-20 07:05:01,681 WARN L193 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-20 07:05:01,684 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:05:01,684 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:05:01,684 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:05:01,684 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:05:01,684 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:05:01,684 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:01,684 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:05:01,685 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:05:01,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration10_Lasso [2020-10-20 07:05:01,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:05:01,685 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:05:01,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,161 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-10-20 07:05:02,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,672 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:05:02,676 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:02,695 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 [2020-10-20 07:05:02,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,726 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 [2020-10-20 07:05:02,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,753 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 [2020-10-20 07:05:02,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,790 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 [2020-10-20 07:05:02,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:02,833 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 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,882 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 [2020-10-20 07:05:02,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:02,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:02,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,922 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 [2020-10-20 07:05:02,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,956 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 [2020-10-20 07:05:02,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,987 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 [2020-10-20 07:05:02,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:02,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:02,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:02,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:02,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:02,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:02,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:02,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,017 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 [2020-10-20 07:05:03,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:03,051 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 [2020-10-20 07:05:03,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,080 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 [2020-10-20 07:05:03,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,127 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 [2020-10-20 07:05:03,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,156 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 [2020-10-20 07:05:03,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,188 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 [2020-10-20 07:05:03,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:03,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 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:03,268 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 [2020-10-20 07:05:03,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,306 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 [2020-10-20 07:05:03,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,341 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 [2020-10-20 07:05:03,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,370 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 [2020-10-20 07:05:03,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,403 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 [2020-10-20 07:05:03,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:03,437 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 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,477 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 [2020-10-20 07:05:03,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,510 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 [2020-10-20 07:05:03,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,540 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 [2020-10-20 07:05:03,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,572 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 [2020-10-20 07:05:03,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,574 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 07:05:03,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,574 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 07:05:03,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,601 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 [2020-10-20 07:05:03,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,645 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 [2020-10-20 07:05:03,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,685 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 [2020-10-20 07:05:03,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,718 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 [2020-10-20 07:05:03,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,747 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 [2020-10-20 07:05:03,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,779 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 [2020-10-20 07:05:03,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:05:03,841 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 07:05:03,841 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:03,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,850 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 07:05:03,851 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:05:03,851 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str.offset >= 0] [2020-10-20 07:05:04,014 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2020-10-20 07:05:04,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:05:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:05:04,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:05:04,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:04,141 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 07:05:04,141 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 07:05:04,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 73 states and 92 transitions. Complement of second has 6 states. [2020-10-20 07:05:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:05:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:05:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-10-20 07:05:04,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2020-10-20 07:05:04,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:04,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2020-10-20 07:05:04,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:04,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2020-10-20 07:05:04,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:04,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2020-10-20 07:05:04,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:04,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2020-10-20 07:05:04,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 07:05:04,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 07:05:04,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2020-10-20 07:05:04,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:04,264 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2020-10-20 07:05:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2020-10-20 07:05:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-10-20 07:05:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-20 07:05:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2020-10-20 07:05:04,267 INFO L714 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2020-10-20 07:05:04,267 INFO L594 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2020-10-20 07:05:04,267 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 07:05:04,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2020-10-20 07:05:04,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:04,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:04,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:04,269 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:04,269 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:04,270 INFO L794 eck$LassoCheckResult]: Stem: 1497#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1473#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1474#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1499#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1500#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1501#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1518#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1517#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1516#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1515#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1514#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1513#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1512#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1511#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1510#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1509#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1508#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1507#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1506#L90-3 assume !(main_~i~1 < 8); 1498#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1469#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1470#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1491#L66 assume parse_expression_list_#t~switch7; 1477#L67-5 [2020-10-20 07:05:04,270 INFO L796 eck$LassoCheckResult]: Loop: 1477#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1483#L67-1 assume parse_expression_list_#t~short10; 1475#L67-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 1477#L67-5 [2020-10-20 07:05:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2020-10-20 07:05:04,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601271662] [2020-10-20 07:05:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2020-10-20 07:05:04,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609542963] [2020-10-20 07:05:04,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2020-10-20 07:05:04,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674062041] [2020-10-20 07:05:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:04,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674062041] [2020-10-20 07:05:04,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:04,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 07:05:04,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944916116] [2020-10-20 07:05:04,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:05:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:05:04,570 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2020-10-20 07:05:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:04,772 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2020-10-20 07:05:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:05:04,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2020-10-20 07:05:04,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-20 07:05:04,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2020-10-20 07:05:04,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 07:05:04,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 07:05:04,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2020-10-20 07:05:04,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:04,776 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2020-10-20 07:05:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2020-10-20 07:05:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2020-10-20 07:05:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 07:05:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2020-10-20 07:05:04,780 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2020-10-20 07:05:04,780 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2020-10-20 07:05:04,780 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 07:05:04,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2020-10-20 07:05:04,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:04,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:04,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:04,782 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:04,782 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:04,782 INFO L794 eck$LassoCheckResult]: Stem: 1668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1642#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1643#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1670#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1671#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1672#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1690#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1689#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1688#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1687#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1686#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1685#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1684#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1683#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1682#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1681#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1680#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 1679#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 1678#L90-3 assume !(main_~i~1 < 8); 1669#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1634#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1635#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1658#L66 assume !parse_expression_list_#t~switch7; 1648#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 1649#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1661#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1659#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1660#L66 assume parse_expression_list_#t~switch7; 1692#L67-5 [2020-10-20 07:05:04,782 INFO L796 eck$LassoCheckResult]: Loop: 1692#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1694#L67-1 assume parse_expression_list_#t~short10; 1693#L67-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 1692#L67-5 [2020-10-20 07:05:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash -159704087, now seen corresponding path program 1 times [2020-10-20 07:05:04,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71995113] [2020-10-20 07:05:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,847 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2020-10-20 07:05:04,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289328942] [2020-10-20 07:05:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,854 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1079341024, now seen corresponding path program 1 times [2020-10-20 07:05:04,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997835321] [2020-10-20 07:05:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,945 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:12,790 WARN L193 SmtUtils]: Spent 7.78 s on a formula simplification. DAG size of input: 266 DAG size of output: 198 [2020-10-20 07:05:13,553 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-20 07:05:13,556 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:05:13,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:05:13,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:05:13,556 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:05:13,556 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:05:13,556 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:13,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:05:13,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:05:13,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2020-10-20 07:05:13,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:05:13,557 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:05:13,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:13,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:14,332 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-10-20 07:05:14,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:14,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:14,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:14,917 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:05:14,918 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:14,925 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 [2020-10-20 07:05:14,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:14,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:14,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:14,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:14,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:14,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:14,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:14,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:14,952 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 [2020-10-20 07:05:14,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:14,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:14,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:14,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:14,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:14,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:14,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:14,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:14,979 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 Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:14,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:14,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:14,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:14,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:14,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:14,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:14,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,008 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 [2020-10-20 07:05:15,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,034 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 [2020-10-20 07:05:15,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,068 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 [2020-10-20 07:05:15,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,096 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 [2020-10-20 07:05:15,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,122 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 [2020-10-20 07:05:15,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,160 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 [2020-10-20 07:05:15,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,187 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 [2020-10-20 07:05:15,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,216 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 [2020-10-20 07:05:15,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,247 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 [2020-10-20 07:05:15,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,274 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 [2020-10-20 07:05:15,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,301 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 [2020-10-20 07:05:15,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,329 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 [2020-10-20 07:05:15,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,359 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 [2020-10-20 07:05:15,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,385 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 [2020-10-20 07:05:15,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,411 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 [2020-10-20 07:05:15,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,441 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 [2020-10-20 07:05:15,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,469 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 [2020-10-20 07:05:15,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:15,497 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 Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,526 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 [2020-10-20 07:05:15,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,553 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 [2020-10-20 07:05:15,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,592 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 [2020-10-20 07:05:15,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,619 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 [2020-10-20 07:05:15,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,660 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 [2020-10-20 07:05:15,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:15,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:15,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:15,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,686 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 [2020-10-20 07:05:15,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:15,717 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 Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,746 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 [2020-10-20 07:05:15,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,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 [2020-10-20 07:05:15,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,806 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 [2020-10-20 07:05:15,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,844 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 [2020-10-20 07:05:15,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,885 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 [2020-10-20 07:05:15,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:15,914 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 [2020-10-20 07:05:15,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,946 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 [2020-10-20 07:05:15,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:15,982 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 [2020-10-20 07:05:15,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:15,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:15,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:15,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:15,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:15,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:15,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:16,030 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 Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:16,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:16,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:16,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:16,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:16,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:16,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:16,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:16,061 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 [2020-10-20 07:05:16,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:16,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:16,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:16,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:16,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:16,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:16,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:16,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:16,089 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 [2020-10-20 07:05:16,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:16,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:16,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:16,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:16,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:16,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:16,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:16,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:16,117 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 [2020-10-20 07:05:16,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:16,119 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 07:05:16,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:16,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:16,121 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 07:05:16,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:16,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:16,150 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 [2020-10-20 07:05:16,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:16,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:16,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:16,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:16,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:16,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:16,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:05:16,225 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-20 07:05:16,225 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:16,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:05:16,231 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:05:16,231 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:05:16,231 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2, ULTIMATE.start_parse_expression_list_~start~0, #t~string0.offset) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 - 1*#t~string0.offset Supporting invariants [] [2020-10-20 07:05:16,344 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2020-10-20 07:05:16,347 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:05:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:16,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 07:05:16,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:16,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:05:16,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:16,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-10-20 07:05:16,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 6 states. [2020-10-20 07:05:16,706 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand 6 states. Result 176 states and 237 transitions. Complement of second has 10 states. [2020-10-20 07:05:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:05:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:05:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-10-20 07:05:16,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-20 07:05:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2020-10-20 07:05:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2020-10-20 07:05:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:16,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2020-10-20 07:05:16,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-10-20 07:05:16,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2020-10-20 07:05:16,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-20 07:05:16,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-20 07:05:16,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2020-10-20 07:05:16,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:16,716 INFO L691 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2020-10-20 07:05:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2020-10-20 07:05:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2020-10-20 07:05:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 07:05:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2020-10-20 07:05:16,723 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2020-10-20 07:05:16,723 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2020-10-20 07:05:16,724 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 07:05:16,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2020-10-20 07:05:16,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:16,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:16,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:16,726 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:16,726 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:16,727 INFO L794 eck$LassoCheckResult]: Stem: 2130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2099#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2100#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2132#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2133#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2134#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2154#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2153#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2152#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2151#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2150#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2149#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2148#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2147#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2146#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2145#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2144#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2143#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2142#L90-3 assume !(main_~i~1 < 8); 2131#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 2095#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2096#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2115#L66 assume parse_expression_list_#t~switch7; 2165#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2163#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2159#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 2157#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2155#L68 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 2137#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2091#L70-8 [2020-10-20 07:05:16,727 INFO L796 eck$LassoCheckResult]: Loop: 2091#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2092#L70-1 assume !parse_expression_list_#t~short17; 2111#L70-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 2091#L70-8 [2020-10-20 07:05:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2020-10-20 07:05:16,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:16,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333742957] [2020-10-20 07:05:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:16,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333742957] [2020-10-20 07:05:16,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:16,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 07:05:16,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876846874] [2020-10-20 07:05:16,904 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2020-10-20 07:05:16,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:16,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994015639] [2020-10-20 07:05:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:16,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994015639] [2020-10-20 07:05:16,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:16,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:05:16,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515917225] [2020-10-20 07:05:16,914 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:05:16,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:05:16,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:05:16,915 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2020-10-20 07:05:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:16,929 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2020-10-20 07:05:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:05:16,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2020-10-20 07:05:16,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:16,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2020-10-20 07:05:16,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 07:05:16,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 07:05:16,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2020-10-20 07:05:16,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:16,934 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2020-10-20 07:05:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2020-10-20 07:05:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-20 07:05:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-20 07:05:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2020-10-20 07:05:16,939 INFO L714 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2020-10-20 07:05:16,939 INFO L594 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2020-10-20 07:05:16,940 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 07:05:16,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2020-10-20 07:05:16,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:16,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:16,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:16,942 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:16,942 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:16,943 INFO L794 eck$LassoCheckResult]: Stem: 2323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2295#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2296#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2326#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2327#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2328#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2374#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2373#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2372#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2371#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2370#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2369#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2368#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2367#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2366#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2365#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2364#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2363#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2362#L90-3 assume !(main_~i~1 < 8); 2325#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 2287#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2288#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2310#L66 assume parse_expression_list_#t~switch7; 2318#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2319#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2345#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 2342#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2337#L68 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 2331#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2289#L70-8 [2020-10-20 07:05:16,943 INFO L796 eck$LassoCheckResult]: Loop: 2289#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2290#L70-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 2307#L70-2 assume parse_expression_list_#t~short16; 2333#L70-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 2324#L70-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 2289#L70-8 [2020-10-20 07:05:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 2 times [2020-10-20 07:05:16,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:16,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131899445] [2020-10-20 07:05:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:17,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131899445] [2020-10-20 07:05:17,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:17,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 07:05:17,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231941646] [2020-10-20 07:05:17,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2020-10-20 07:05:17,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833146932] [2020-10-20 07:05:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,158 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:17,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:05:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:05:17,251 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 8 states. [2020-10-20 07:05:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:17,478 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2020-10-20 07:05:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:05:17,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2020-10-20 07:05:17,483 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-20 07:05:17,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 117 states and 151 transitions. [2020-10-20 07:05:17,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-10-20 07:05:17,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-10-20 07:05:17,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 151 transitions. [2020-10-20 07:05:17,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:17,485 INFO L691 BuchiCegarLoop]: Abstraction has 117 states and 151 transitions. [2020-10-20 07:05:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 151 transitions. [2020-10-20 07:05:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2020-10-20 07:05:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-20 07:05:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2020-10-20 07:05:17,490 INFO L714 BuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2020-10-20 07:05:17,490 INFO L594 BuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2020-10-20 07:05:17,490 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 07:05:17,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 116 transitions. [2020-10-20 07:05:17,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:17,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:17,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:17,492 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:17,493 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:17,493 INFO L794 eck$LassoCheckResult]: Stem: 2560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2531#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2532#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2563#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2564#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2565#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2584#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2583#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2582#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2581#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2580#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2579#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2578#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2577#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2576#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2575#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2574#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2573#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2572#L90-3 assume !(main_~i~1 < 8); 2562#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 2523#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2524#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2547#L66 assume parse_expression_list_#t~switch7; 2556#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2540#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2533#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 2534#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2552#L68 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2566#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2525#L70-8 [2020-10-20 07:05:17,493 INFO L796 eck$LassoCheckResult]: Loop: 2525#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2526#L70-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 2544#L70-2 assume parse_expression_list_#t~short16; 2568#L70-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 2561#L70-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 2525#L70-8 [2020-10-20 07:05:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2020-10-20 07:05:17,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237807392] [2020-10-20 07:05:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,527 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2020-10-20 07:05:17,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189762346] [2020-10-20 07:05:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2020-10-20 07:05:17,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498159749] [2020-10-20 07:05:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:17,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498159749] [2020-10-20 07:05:17,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:17,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:17,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041204291] [2020-10-20 07:05:17,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:17,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:05:17,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:05:17,693 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. cyclomatic complexity: 35 Second operand 6 states. [2020-10-20 07:05:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:17,838 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2020-10-20 07:05:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:05:17,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 172 transitions. [2020-10-20 07:05:17,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 07:05:17,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 127 states and 164 transitions. [2020-10-20 07:05:17,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:05:17,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:05:17,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 164 transitions. [2020-10-20 07:05:17,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:17,842 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 164 transitions. [2020-10-20 07:05:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 164 transitions. [2020-10-20 07:05:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2020-10-20 07:05:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-20 07:05:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2020-10-20 07:05:17,846 INFO L714 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2020-10-20 07:05:17,846 INFO L594 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2020-10-20 07:05:17,847 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 07:05:17,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2020-10-20 07:05:17,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:17,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:17,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:17,849 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:17,849 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:17,850 INFO L794 eck$LassoCheckResult]: Stem: 2798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2771#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2772#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2801#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2802#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2803#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2832#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2831#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2830#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2829#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2828#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2827#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2825#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2823#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2821#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2819#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2817#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 2814#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 2813#L90-3 assume !(main_~i~1 < 8); 2800#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 2763#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2764#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2786#L66 assume !parse_expression_list_#t~switch7; 2805#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 2850#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2849#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2787#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2788#L66 assume parse_expression_list_#t~switch7; 2795#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2779#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2773#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 2774#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2811#L68 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2806#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2765#L70-8 [2020-10-20 07:05:17,850 INFO L796 eck$LassoCheckResult]: Loop: 2765#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2766#L70-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 2783#L70-2 assume parse_expression_list_#t~short16; 2808#L70-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 2799#L70-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 2765#L70-8 [2020-10-20 07:05:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1769863882, now seen corresponding path program 1 times [2020-10-20 07:05:17,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430232813] [2020-10-20 07:05:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2020-10-20 07:05:17,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074689929] [2020-10-20 07:05:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:17,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:17,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 311030449, now seen corresponding path program 1 times [2020-10-20 07:05:17,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:17,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428441580] [2020-10-20 07:05:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:17,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428441580] [2020-10-20 07:05:17,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715646647] [2020-10-20 07:05:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:05:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:18,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:05:18,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:18,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:05:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:18,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:05:18,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 07:05:18,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668728986] [2020-10-20 07:05:18,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:18,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:05:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:05:18,181 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 34 Second operand 7 states. [2020-10-20 07:05:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:18,381 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2020-10-20 07:05:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:05:18,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 239 transitions. [2020-10-20 07:05:18,385 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 07:05:18,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 167 states and 217 transitions. [2020-10-20 07:05:18,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 07:05:18,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 07:05:18,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 217 transitions. [2020-10-20 07:05:18,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:18,387 INFO L691 BuchiCegarLoop]: Abstraction has 167 states and 217 transitions. [2020-10-20 07:05:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 217 transitions. [2020-10-20 07:05:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 132. [2020-10-20 07:05:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-20 07:05:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2020-10-20 07:05:18,392 INFO L714 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2020-10-20 07:05:18,392 INFO L594 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2020-10-20 07:05:18,392 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 07:05:18,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 172 transitions. [2020-10-20 07:05:18,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 07:05:18,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:18,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:18,395 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:18,396 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:18,396 INFO L794 eck$LassoCheckResult]: Stem: 3208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 3181#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3182#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3210#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3211#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3212#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3235#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3234#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3233#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3232#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3231#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3230#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3229#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3228#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3227#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3226#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3225#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3224#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3223#L90-3 assume !(main_~i~1 < 8); 3209#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 3177#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3178#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 3196#L66 assume !parse_expression_list_#t~switch7; 3218#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 3269#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3270#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 3284#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 3283#L66 assume !parse_expression_list_#t~switch7; 3263#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 3268#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3265#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 3264#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 3262#L66 assume parse_expression_list_#t~switch7; 3260#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 3257#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 3253#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 3251#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3240#L68 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 3213#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3173#L70-8 [2020-10-20 07:05:18,396 INFO L796 eck$LassoCheckResult]: Loop: 3173#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3174#L70-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 3194#L70-2 assume parse_expression_list_#t~short16; 3215#L70-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 3207#L70-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 3173#L70-8 [2020-10-20 07:05:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1800242060, now seen corresponding path program 1 times [2020-10-20 07:05:18,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:18,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841588719] [2020-10-20 07:05:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:18,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:18,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:18,486 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 4 times [2020-10-20 07:05:18,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:18,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883479434] [2020-10-20 07:05:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:18,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:18,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:18,495 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash 436075035, now seen corresponding path program 1 times [2020-10-20 07:05:18,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:18,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411871144] [2020-10-20 07:05:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:18,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:18,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:18,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:28,400 WARN L193 SmtUtils]: Spent 9.76 s on a formula simplification. DAG size of input: 321 DAG size of output: 226 [2020-10-20 07:05:29,151 WARN L193 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-20 07:05:29,154 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:05:29,154 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:05:29,154 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:05:29,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:05:29,154 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:05:29,154 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:29,155 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:05:29,155 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:05:29,155 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration17_Lasso [2020-10-20 07:05:29,155 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:05:29,155 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:05:29,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,887 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-10-20 07:05:29,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:29,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:30,667 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:05:30,668 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,672 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 [2020-10-20 07:05:30,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,698 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 [2020-10-20 07:05:30,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,725 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 [2020-10-20 07:05:30,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:30,752 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 Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:30,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:30,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,782 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 [2020-10-20 07:05:30,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:30,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:30,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,812 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 [2020-10-20 07:05:30,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,840 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 [2020-10-20 07:05:30,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:30,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:30,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,873 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 [2020-10-20 07:05:30,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,902 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 [2020-10-20 07:05:30,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,931 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 [2020-10-20 07:05:30,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,958 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 [2020-10-20 07:05:30,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:30,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:30,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:30,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:30,987 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 [2020-10-20 07:05:30,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:30,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:30,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:30,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:30,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:30,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:30,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,017 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 [2020-10-20 07:05:31,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:31,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:31,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:31,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,046 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 [2020-10-20 07:05:31,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:31,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:31,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:31,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,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 [2020-10-20 07:05:31,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:31,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:31,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:31,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,103 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 [2020-10-20 07:05:31,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,132 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 [2020-10-20 07:05:31,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:31,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:31,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:31,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,160 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 [2020-10-20 07:05:31,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,190 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 [2020-10-20 07:05:31,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,220 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 [2020-10-20 07:05:31,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,256 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 [2020-10-20 07:05:31,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,287 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 [2020-10-20 07:05:31,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,317 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 [2020-10-20 07:05:31,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,347 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 [2020-10-20 07:05:31,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,388 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 [2020-10-20 07:05:31,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:31,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:31,430 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 [2020-10-20 07:05:31,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:31,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:31,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:31,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:31,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:31,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:05:31,483 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 07:05:31,483 INFO L444 ModelExtractionUtils]: 12 out of 28 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:31,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:31,489 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:05:31,490 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:05:31,490 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 [] [2020-10-20 07:05:31,694 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2020-10-20 07:05:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:31,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:05:31,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:31,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:05:31,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:31,820 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 [2020-10-20 07:05:31,820 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50 Second operand 4 states. [2020-10-20 07:05:32,003 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50. Second operand 4 states. Result 292 states and 386 transitions. Complement of second has 11 states. [2020-10-20 07:05:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:05:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:05:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2020-10-20 07:05:32,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2020-10-20 07:05:32,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:32,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2020-10-20 07:05:32,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:32,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2020-10-20 07:05:32,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:32,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 386 transitions. [2020-10-20 07:05:32,010 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2020-10-20 07:05:32,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 192 states and 251 transitions. [2020-10-20 07:05:32,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-20 07:05:32,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-20 07:05:32,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 251 transitions. [2020-10-20 07:05:32,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:32,013 INFO L691 BuchiCegarLoop]: Abstraction has 192 states and 251 transitions. [2020-10-20 07:05:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 251 transitions. [2020-10-20 07:05:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2020-10-20 07:05:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-20 07:05:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2020-10-20 07:05:32,017 INFO L714 BuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2020-10-20 07:05:32,017 INFO L594 BuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2020-10-20 07:05:32,017 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 07:05:32,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 179 transitions. [2020-10-20 07:05:32,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 07:05:32,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:32,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:32,020 INFO L852 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] [2020-10-20 07:05:32,020 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:32,020 INFO L794 eck$LassoCheckResult]: Stem: 3898#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 3870#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3871#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3900#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3901#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3902#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3925#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3924#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3923#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3922#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3921#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3920#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3919#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3918#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3917#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3916#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3915#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 3914#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 3913#L90-3 assume !(main_~i~1 < 8); 3899#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 3866#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3867#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 3887#L66 assume parse_expression_list_#t~switch7; 3951#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 3950#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 3949#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 3948#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3947#L68 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 3946#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3945#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3944#L70-1 assume !parse_expression_list_#t~short17; 3943#L70-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16; 3942#L70-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 3941#L71 assume !parse_expression_list_#t~short20; 3940#L71-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19;havoc parse_expression_list_#t~short20; 3939#L71-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3938#L73 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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 3937#L42 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.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; 3936#L15 assume !(0 == __VERIFIER_assert_~cond); 3935#L15-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); 3934#L72 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3933#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 3932#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3931#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 3930#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 3928#L66 assume parse_expression_list_#t~switch7; 3873#L67-5 [2020-10-20 07:05:32,021 INFO L796 eck$LassoCheckResult]: Loop: 3873#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 3927#L67-1 assume parse_expression_list_#t~short10; 3872#L67-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 3873#L67-5 [2020-10-20 07:05:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash -457267248, now seen corresponding path program 1 times [2020-10-20 07:05:32,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:32,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996081572] [2020-10-20 07:05:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-10-20 07:05:32,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996081572] [2020-10-20 07:05:32,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:32,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:05:32,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572218929] [2020-10-20 07:05:32,096 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2020-10-20 07:05:32,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:32,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040226639] [2020-10-20 07:05:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:32,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:32,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:32,104 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:32,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:32,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:05:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:05:32,170 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. cyclomatic complexity: 51 Second operand 5 states. [2020-10-20 07:05:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:32,324 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2020-10-20 07:05:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:05:32,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 182 transitions. [2020-10-20 07:05:32,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:32,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 127 states and 167 transitions. [2020-10-20 07:05:32,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 07:05:32,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 07:05:32,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 167 transitions. [2020-10-20 07:05:32,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:32,330 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. [2020-10-20 07:05:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 167 transitions. [2020-10-20 07:05:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-10-20 07:05:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-20 07:05:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2020-10-20 07:05:32,334 INFO L714 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2020-10-20 07:05:32,334 INFO L594 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2020-10-20 07:05:32,334 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 07:05:32,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2020-10-20 07:05:32,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:32,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:32,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:32,336 INFO L852 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] [2020-10-20 07:05:32,337 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:32,337 INFO L794 eck$LassoCheckResult]: Stem: 4190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 4159#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 4160#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4192#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4193#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4194#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4201#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4231#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4228#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4225#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4224#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4221#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4217#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4213#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4211#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4208#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4207#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4206#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4205#L90-3 assume !(main_~i~1 < 8); 4191#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 4155#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4156#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 4174#L66 assume !parse_expression_list_#t~switch7; 4166#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 4167#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4179#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 4180#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 4251#L66 assume parse_expression_list_#t~switch7; 4247#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 4249#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 4246#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 4244#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4243#L68 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 4200#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4153#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4154#L70-1 assume !parse_expression_list_#t~short17; 4173#L70-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16; 4223#L70-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 4220#L71 assume !parse_expression_list_#t~short20; 4216#L71-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19;havoc parse_expression_list_#t~short20; 4148#L71-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4157#L73 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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 4158#L42 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.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; 4170#L15 assume !(0 == __VERIFIER_assert_~cond); 4171#L15-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); 4181#L72 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4182#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 4218#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4214#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 4212#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 4209#L66 assume parse_expression_list_#t~switch7; 4163#L67-5 [2020-10-20 07:05:32,337 INFO L796 eck$LassoCheckResult]: Loop: 4163#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 4168#L67-1 assume parse_expression_list_#t~short10; 4161#L67-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 4163#L67-5 [2020-10-20 07:05:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1498929950, now seen corresponding path program 1 times [2020-10-20 07:05:32,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:32,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375345140] [2020-10-20 07:05:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-10-20 07:05:32,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375345140] [2020-10-20 07:05:32,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:32,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:32,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449225219] [2020-10-20 07:05:32,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:32,408 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2020-10-20 07:05:32,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:32,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409084841] [2020-10-20 07:05:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:32,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:32,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:32,420 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:32,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:32,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:05:32,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:05:32,502 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 6 states. [2020-10-20 07:05:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:32,728 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2020-10-20 07:05:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:05:32,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 215 transitions. [2020-10-20 07:05:32,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:32,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 144 states and 185 transitions. [2020-10-20 07:05:32,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 07:05:32,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 07:05:32,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 185 transitions. [2020-10-20 07:05:32,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:32,734 INFO L691 BuchiCegarLoop]: Abstraction has 144 states and 185 transitions. [2020-10-20 07:05:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 185 transitions. [2020-10-20 07:05:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 115. [2020-10-20 07:05:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-20 07:05:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2020-10-20 07:05:32,738 INFO L714 BuchiCegarLoop]: Abstraction has 115 states and 149 transitions. [2020-10-20 07:05:32,738 INFO L594 BuchiCegarLoop]: Abstraction has 115 states and 149 transitions. [2020-10-20 07:05:32,738 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 07:05:32,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 149 transitions. [2020-10-20 07:05:32,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:32,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:32,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:32,740 INFO L852 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] [2020-10-20 07:05:32,741 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:32,741 INFO L794 eck$LassoCheckResult]: Stem: 4482#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 4449#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~post23, main_~i~1, main_#t~ret25, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 4450#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4484#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4485#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4486#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4511#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4510#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4509#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4508#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4507#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4506#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4505#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4504#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4503#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4502#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4500#L90-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet24, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet24; 4497#L90-2 main_#t~post23 := main_~i~1;main_~i~1 := 1 + main_#t~post23;havoc main_#t~post23; 4496#L90-3 assume !(main_~i~1 < 8); 4483#L90-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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 4445#L62 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4446#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 4465#L66 assume !parse_expression_list_#t~switch7; 4456#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 4457#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4471#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 4472#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 4543#L66 assume parse_expression_list_#t~switch7; 4542#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 4541#L67-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 4540#L67-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8; 4539#L67-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4538#L68 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 4537#L68-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4529#L70-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4519#L70-1 assume !parse_expression_list_#t~short17; 4516#L70-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short16; 4515#L70-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 4514#L71 assume !parse_expression_list_#t~short20; 4513#L71-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19;havoc parse_expression_list_#t~short20; 4437#L71-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4447#L73 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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 4448#L42 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.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; 4461#L15 assume !(0 == __VERIFIER_assert_~cond); 4462#L15-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); 4473#L72 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4474#L65 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 4501#L63-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4499#L63-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 4498#L63-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 4494#L66 assume parse_expression_list_#t~switch7; 4453#L67-5 [2020-10-20 07:05:32,741 INFO L796 eck$LassoCheckResult]: Loop: 4453#L67-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 4458#L67-1 assume parse_expression_list_#t~short10; 4451#L67-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 4453#L67-5 [2020-10-20 07:05:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1107093604, now seen corresponding path program 1 times [2020-10-20 07:05:32,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:32,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906097828] [2020-10-20 07:05:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-20 07:05:32,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906097828] [2020-10-20 07:05:32,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431721197] [2020-10-20 07:05:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:05:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:32,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 07:05:32,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:32,976 INFO L384 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 [2020-10-20 07:05:32,977 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:32,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:32,981 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:05:32,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 07:05:32,997 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:32,998 INFO L384 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 [2020-10-20 07:05:32,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:33,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:33,001 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:05:33,001 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-20 07:05:33,061 INFO L384 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 [2020-10-20 07:05:33,061 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:33,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:33,076 INFO L545 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. [2020-10-20 07:05:33,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2020-10-20 07:05:33,140 INFO L384 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 [2020-10-20 07:05:33,142 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:33,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:33,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:05:33,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2020-10-20 07:05:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-10-20 07:05:33,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:05:33,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-10-20 07:05:33,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339820426] [2020-10-20 07:05:33,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2020-10-20 07:05:33,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:33,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238048165] [2020-10-20 07:05:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:33,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:33,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:33,169 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:33,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:33,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 07:05:33,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-20 07:05:33,241 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. cyclomatic complexity: 42 Second operand 10 states. [2020-10-20 07:05:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:33,539 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2020-10-20 07:05:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:05:33,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 112 transitions. [2020-10-20 07:05:33,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:05:33,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2020-10-20 07:05:33,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 07:05:33,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 07:05:33,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 07:05:33,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:05:33,541 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:05:33,542 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:05:33,542 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:05:33,542 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 07:05:33,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 07:05:33,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:05:33,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 07:05:33,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:05:33 BoogieIcfgContainer [2020-10-20 07:05:33,550 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:05:33,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:05:33,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:05:33,552 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:05:33,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:04:51" (3/4) ... [2020-10-20 07:05:33,557 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 07:05:33,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:05:33,559 INFO L168 Benchmark]: Toolchain (without parser) took 43649.48 ms. Allocated memory was 43.0 MB in the beginning and 138.4 MB in the end (delta: 95.4 MB). Free memory was 25.2 MB in the beginning and 71.0 MB in the end (delta: -45.8 MB). Peak memory consumption was 49.6 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,559 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 32.5 MB. Free memory was 11.2 MB in the beginning and 11.1 MB in the end (delta: 52.8 kB). Peak memory consumption was 52.8 kB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.59 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 24.3 MB in the beginning and 26.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.29 ms. Allocated memory is still 45.6 MB. Free memory was 26.1 MB in the beginning and 24.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,561 INFO L168 Benchmark]: Boogie Preprocessor took 36.04 ms. Allocated memory is still 45.6 MB. Free memory was 24.1 MB in the beginning and 22.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,561 INFO L168 Benchmark]: RCFGBuilder took 556.82 ms. Allocated memory was 45.6 MB in the beginning and 46.1 MB in the end (delta: 524.3 kB). Free memory was 22.2 MB in the beginning and 19.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,561 INFO L168 Benchmark]: BuchiAutomizer took 42519.96 ms. Allocated memory was 46.1 MB in the beginning and 138.4 MB in the end (delta: 92.3 MB). Free memory was 18.7 MB in the beginning and 71.0 MB in the end (delta: -52.3 MB). Peak memory consumption was 40.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:33,561 INFO L168 Benchmark]: Witness Printer took 5.80 ms. Allocated memory is still 138.4 MB. Free memory is still 71.0 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 07:05:33,563 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 32.5 MB. Free memory was 11.2 MB in the beginning and 11.1 MB in the end (delta: 52.8 kB). Peak memory consumption was 52.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 467.59 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 24.3 MB in the beginning and 26.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.29 ms. Allocated memory is still 45.6 MB. Free memory was 26.1 MB in the beginning and 24.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 36.04 ms. Allocated memory is still 45.6 MB. Free memory was 24.1 MB in the beginning and 22.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 556.82 ms. Allocated memory was 45.6 MB in the beginning and 46.1 MB in the end (delta: 524.3 kB). Free memory was 22.2 MB in the beginning and 19.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 42519.96 ms. Allocated memory was 46.1 MB in the beginning and 138.4 MB in the end (delta: 92.3 MB). Free memory was 18.7 MB in the beginning and 71.0 MB in the end (delta: -52.3 MB). Peak memory consumption was 40.0 MB. Max. memory is 14.3 GB. * Witness Printer took 5.80 ms. Allocated memory is still 138.4 MB. Free memory is still 71.0 MB. There was no memory consumed. Max. memory is 14.3 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (16 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 * unknown-#length-unknown[A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start + -1 * "0" and consists of 7 locations. One deterministic module has affine ranking function j and consists of 6 locations. 16 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.4s and 21 iterations. TraceHistogramMax:8. Analysis of lassos took 38.9s. Construction of modules took 1.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 281 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 138 states and ocurred in iteration 17. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 732 SDtfs, 864 SDslu, 1808 SDs, 0 SdLazy, 876 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU12 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax100 hnf100 lsp93 ukn53 mio100 lsp40 div100 bol100 ite100 ukn100 eq186 hnf87 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...