./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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-906a4fb [2020-10-19 19:11:38,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:11:38,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:11:38,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:11:38,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:11:38,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:11:38,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:11:38,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:11:38,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:11:38,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:11:38,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:11:38,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:11:38,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:11:38,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:11:38,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:11:38,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:11:38,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:11:38,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:11:38,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:11:38,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:11:38,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:11:38,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:11:38,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:11:38,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:11:38,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:11:38,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:11:38,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:11:38,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:11:38,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:11:38,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:11:38,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:11:38,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:11:38,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:11:38,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:11:38,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:11:38,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:11:38,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:11:38,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:11:38,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:11:38,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:11:38,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:11:38,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:11:38,176 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:11:38,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:11:38,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:11:38,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:11:38,178 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:11:38,179 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:11:38,179 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:11:38,179 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:11:38,179 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:11:38,180 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:11:38,180 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:11:38,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:11:38,180 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:11:38,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:11:38,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:11:38,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:11:38,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:11:38,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:11:38,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:11:38,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:11:38,183 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:11:38,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:11:38,183 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:11:38,184 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:11:38,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:11:38,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:11:38,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:11:38,185 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:11:38,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:11:38,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:11:38,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:11:38,186 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:11:38,187 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:11:38,187 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-19 19:11:38,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:11:38,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:11:38,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:11:38,515 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:11:38,515 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:11:38,516 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-19 19:11:38,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0484c2c11/ca41887f515c48489ad5589633520a1f/FLAG87e5ead92 [2020-10-19 19:11:39,052 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:11:39,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-10-19 19:11:39,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0484c2c11/ca41887f515c48489ad5589633520a1f/FLAG87e5ead92 [2020-10-19 19:11:39,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0484c2c11/ca41887f515c48489ad5589633520a1f [2020-10-19 19:11:39,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:11:39,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:11:39,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:11:39,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:11:39,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:11:39,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcbdfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39, skipping insertion in model container [2020-10-19 19:11:39,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:11:39,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:11:39,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:11:39,675 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:11:39,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:11:39,832 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:11:39,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39 WrapperNode [2020-10-19 19:11:39,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:11:39,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:11:39,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:11:39,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:11:39,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:11:39,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:11:39,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:11:39,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:11:39,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (1/1) ... [2020-10-19 19:11:39,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:11:39,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:11:39,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:11:39,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:11:39,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (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-19 19:11:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:11:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 19:11:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 19:11:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:11:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-10-19 19:11:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:11:40,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:11:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 19:11:40,389 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:11:40,390 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-10-19 19:11:40,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:11:40 BoogieIcfgContainer [2020-10-19 19:11:40,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:11:40,393 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:11:40,393 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:11:40,398 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:11:40,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:11:40,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:11:39" (1/3) ... [2020-10-19 19:11:40,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c77db60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:11:40, skipping insertion in model container [2020-10-19 19:11:40,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:11:40,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:11:39" (2/3) ... [2020-10-19 19:11:40,402 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c77db60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:11:40, skipping insertion in model container [2020-10-19 19:11:40,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:11:40,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:11:40" (3/3) ... [2020-10-19 19:11:40,404 INFO L373 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-10-19 19:11:40,458 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:11:40,459 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:11:40,459 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:11:40,459 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:11:40,459 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:11:40,460 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:11:40,460 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:11:40,460 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:11:40,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-10-19 19:11:40,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2020-10-19 19:11:40,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:40,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:40,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:11:40,514 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:11:40,515 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:11:40,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-10-19 19:11:40,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2020-10-19 19:11:40,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:40,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:40,520 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:11:40,520 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:11:40,540 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-19 19:11:40,541 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-19 19:11:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 19:11:40,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:40,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477555155] [2020-10-19 19:11:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:40,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:40,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:40,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-19 19:11:40,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:40,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021446137] [2020-10-19 19:11:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:40,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:40,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:40,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-19 19:11:40,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:40,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307310120] [2020-10-19 19:11:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:40,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:40,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:40,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:41,072 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-19 19:11:41,207 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:11:41,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:11:41,210 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:11:41,210 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:11:41,210 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:11:41,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:41,211 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:11:41,211 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:11:41,211 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2020-10-19 19:11:41,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:11:41,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:11:41,249 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-19 19:11:41,448 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-19 19:11:41,452 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-19 19:11:41,456 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-19 19:11:41,459 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-19 19:11:41,463 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-19 19:11:41,466 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-19 19:11:41,738 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:11:41,744 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) [2020-10-19 19:11:41,759 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-19 19:11:41,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:41,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:41,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:41,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:41,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:41,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:41,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 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-19 19:11:41,828 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-19 19:11:41,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:41,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:41,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:41,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:41,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:41,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:41,856 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:41,895 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-19 19:11:41,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:41,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:41,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:41,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:41,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:41,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:41,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:11:41,957 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 19:11:41,958 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:41,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:11:41,976 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:11:41,977 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:11:41,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1) = -2*ULTIMATE.start_main_~i~1 + 15*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 Supporting invariants [] [2020-10-19 19:11:42,044 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 19:11:42,057 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 19:11:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:42,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:11:42,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:42,147 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:11:42,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:42,197 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-19 19:11:42,215 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-19 19:11:42,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states. Second operand 3 states. [2020-10-19 19:11:42,389 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-19 19:11:42,391 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-19 19:11:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:11:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2020-10-19 19:11:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-19 19:11:42,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:11:42,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 19:11:42,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:11:42,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 106 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-19 19:11:42,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:11:42,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 159 transitions. [2020-10-19 19:11:42,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:42,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 32 states and 43 transitions. [2020-10-19 19:11:42,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-19 19:11:42,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:42,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2020-10-19 19:11:42,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:42,430 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-19 19:11:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2020-10-19 19:11:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-19 19:11:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 19:11:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-19 19:11:42,462 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-19 19:11:42,463 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-19 19:11:42,463 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:11:42,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-10-19 19:11:42,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:42,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:42,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:42,465 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:42,465 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:42,466 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-19 19:11:42,466 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-19 19:11:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2020-10-19 19:11:42,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:42,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122433067] [2020-10-19 19:11:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:42,524 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-19 19:11:42,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122433067] [2020-10-19 19:11:42,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:11:42,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 19:11:42,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476224916] [2020-10-19 19:11:42,530 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 1 times [2020-10-19 19:11:42,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:42,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659314720] [2020-10-19 19:11:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:42,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:42,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:42,547 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:42,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:42,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:11:42,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:11:42,615 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 19:11:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:42,630 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-10-19 19:11:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:11:42,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-10-19 19:11:42,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:42,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2020-10-19 19:11:42,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:42,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:42,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2020-10-19 19:11:42,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:42,635 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-10-19 19:11:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2020-10-19 19:11:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-10-19 19:11:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 19:11:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-10-19 19:11:42,639 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 19:11:42,640 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-19 19:11:42,640 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:11:42,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-10-19 19:11:42,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:42,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:42,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:42,642 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:11:42,642 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:42,643 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-19 19:11:42,643 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-19 19:11:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2020-10-19 19:11:42,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:42,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261447292] [2020-10-19 19:11:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:42,690 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-19 19:11:42,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261447292] [2020-10-19 19:11:42,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443619499] [2020-10-19 19:11:42,691 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-19 19:11:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:42,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 19:11:42,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:42,770 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-19 19:11:42,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:42,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 19:11:42,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782631580] [2020-10-19 19:11:42,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 2 times [2020-10-19 19:11:42,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:42,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320728092] [2020-10-19 19:11:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:42,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:42,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:42,798 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:42,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:11:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:11:42,858 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 19:11:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:42,885 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-10-19 19:11:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:11:42,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2020-10-19 19:11:42,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:42,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2020-10-19 19:11:42,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:42,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:42,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2020-10-19 19:11:42,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:42,891 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-19 19:11:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2020-10-19 19:11:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-10-19 19:11:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-19 19:11:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-19 19:11:42,895 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 19:11:42,895 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-19 19:11:42,895 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:11:42,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-10-19 19:11:42,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:42,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:42,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:42,903 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-19 19:11:42,903 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:42,903 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-19 19:11:42,904 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-19 19:11:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2020-10-19 19:11:42,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:42,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982151778] [2020-10-19 19:11:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:42,972 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-19 19:11:42,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982151778] [2020-10-19 19:11:42,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556187215] [2020-10-19 19:11:42,973 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-19 19:11:43,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 19:11:43,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:11:43,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:11:43,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:43,058 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-19 19:11:43,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:43,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 19:11:43,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692945390] [2020-10-19 19:11:43,060 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 3 times [2020-10-19 19:11:43,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790969904] [2020-10-19 19:11:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:43,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:11:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:11:43,132 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-10-19 19:11:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:43,153 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-10-19 19:11:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:11:43,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-10-19 19:11:43,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2020-10-19 19:11:43,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:43,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:43,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2020-10-19 19:11:43,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:43,157 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2020-10-19 19:11:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2020-10-19 19:11:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-10-19 19:11:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-19 19:11:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-10-19 19:11:43,162 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-19 19:11:43,162 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-19 19:11:43,162 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:11:43,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2020-10-19 19:11:43,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:43,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:43,164 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-10-19 19:11:43,165 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:43,165 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-19 19:11:43,165 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-19 19:11:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2020-10-19 19:11:43,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731195190] [2020-10-19 19:11:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:43,213 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-19 19:11:43,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731195190] [2020-10-19 19:11:43,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263095257] [2020-10-19 19:11:43,214 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-19 19:11:43,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 19:11:43,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:11:43,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 19:11:43,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:43,318 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-19 19:11:43,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:43,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 19:11:43,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337048853] [2020-10-19 19:11:43,319 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 4 times [2020-10-19 19:11:43,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981692173] [2020-10-19 19:11:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,331 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:43,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:43,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 19:11:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 19:11:43,392 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-10-19 19:11:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:43,418 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-10-19 19:11:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 19:11:43,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-10-19 19:11:43,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2020-10-19 19:11:43,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:43,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:43,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2020-10-19 19:11:43,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:43,422 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-10-19 19:11:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2020-10-19 19:11:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-10-19 19:11:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-19 19:11:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2020-10-19 19:11:43,425 INFO L714 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-10-19 19:11:43,425 INFO L594 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-10-19 19:11:43,426 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:11:43,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2020-10-19 19:11:43,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:43,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:43,427 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2020-10-19 19:11:43,428 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:43,428 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-19 19:11:43,428 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-19 19:11:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2020-10-19 19:11:43,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040526758] [2020-10-19 19:11:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:43,482 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-19 19:11:43,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040526758] [2020-10-19 19:11:43,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185024594] [2020-10-19 19:11:43,483 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-19 19:11:43,540 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 19:11:43,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:11:43,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:11:43,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:43,565 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-19 19:11:43,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:43,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 19:11:43,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001904081] [2020-10-19 19:11:43,567 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 5 times [2020-10-19 19:11:43,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370512931] [2020-10-19 19:11:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,578 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:43,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:43,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 19:11:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 19:11:43,647 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-19 19:11:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:43,677 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-10-19 19:11:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:11:43,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2020-10-19 19:11:43,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2020-10-19 19:11:43,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:43,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:43,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2020-10-19 19:11:43,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:43,681 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-10-19 19:11:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2020-10-19 19:11:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-10-19 19:11:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-19 19:11:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2020-10-19 19:11:43,684 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-10-19 19:11:43,685 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-10-19 19:11:43,685 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 19:11:43,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2020-10-19 19:11:43,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:43,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:43,687 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2020-10-19 19:11:43,687 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:43,687 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-19 19:11:43,688 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-19 19:11:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2020-10-19 19:11:43,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565447342] [2020-10-19 19:11:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:43,754 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-19 19:11:43,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565447342] [2020-10-19 19:11:43,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680979875] [2020-10-19 19:11:43,755 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-19 19:11:43,814 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-19 19:11:43,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:11:43,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 19:11:43,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:43,839 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-19 19:11:43,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:43,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-19 19:11:43,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048051998] [2020-10-19 19:11:43,841 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 6 times [2020-10-19 19:11:43,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817879487] [2020-10-19 19:11:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:43,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:43,851 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:43,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 19:11:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-19 19:11:43,910 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2020-10-19 19:11:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:43,937 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-10-19 19:11:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 19:11:43,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2020-10-19 19:11:43,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2020-10-19 19:11:43,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:43,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:43,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2020-10-19 19:11:43,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:43,941 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-19 19:11:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2020-10-19 19:11:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-10-19 19:11:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-19 19:11:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2020-10-19 19:11:43,944 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2020-10-19 19:11:43,944 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2020-10-19 19:11:43,944 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 19:11:43,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2020-10-19 19:11:43,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:43,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:43,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:43,946 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2020-10-19 19:11:43,946 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:43,947 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-19 19:11:43,947 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-19 19:11:43,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2020-10-19 19:11:43,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:43,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338817061] [2020-10-19 19:11:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:44,011 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-19 19:11:44,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338817061] [2020-10-19 19:11:44,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595843277] [2020-10-19 19:11:44,012 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-19 19:11:44,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-19 19:11:44,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:11:44,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 19:11:44,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:44,110 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-19 19:11:44,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:44,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-19 19:11:44,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160148509] [2020-10-19 19:11:44,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 7 times [2020-10-19 19:11:44,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:44,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061728221] [2020-10-19 19:11:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,124 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:44,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 19:11:44,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-19 19:11:44,172 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-19 19:11:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:44,204 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-10-19 19:11:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:11:44,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2020-10-19 19:11:44,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:44,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2020-10-19 19:11:44,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:44,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:44,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-10-19 19:11:44,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:44,207 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-10-19 19:11:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-10-19 19:11:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2020-10-19 19:11:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-19 19:11:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2020-10-19 19:11:44,210 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2020-10-19 19:11:44,210 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2020-10-19 19:11:44,211 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 19:11:44,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2020-10-19 19:11:44,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:44,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:44,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:44,212 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2020-10-19 19:11:44,213 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:44,213 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-19 19:11:44,213 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-19 19:11:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2020-10-19 19:11:44,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:44,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982129451] [2020-10-19 19:11:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:44,287 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-19 19:11:44,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982129451] [2020-10-19 19:11:44,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699641528] [2020-10-19 19:11:44,288 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-19 19:11:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:44,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 19:11:44,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:44,364 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-19 19:11:44,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:11:44,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-19 19:11:44,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021980337] [2020-10-19 19:11:44,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:11:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 8 times [2020-10-19 19:11:44,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:44,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578105782] [2020-10-19 19:11:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,376 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:44,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 19:11:44,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-19 19:11:44,431 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-10-19 19:11:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:44,464 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-10-19 19:11:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 19:11:44,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2020-10-19 19:11:44,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:44,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2020-10-19 19:11:44,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:11:44,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:11:44,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2020-10-19 19:11:44,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:11:44,467 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-19 19:11:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2020-10-19 19:11:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-19 19:11:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-19 19:11:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2020-10-19 19:11:44,471 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-19 19:11:44,471 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-19 19:11:44,471 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 19:11:44,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2020-10-19 19:11:44,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-19 19:11:44,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:44,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:44,473 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2020-10-19 19:11:44,473 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:11:44,474 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-19 19:11:44,474 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-19 19:11:44,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2020-10-19 19:11:44,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:44,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563404565] [2020-10-19 19:11:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,514 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 9 times [2020-10-19 19:11:44,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:44,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552299713] [2020-10-19 19:11:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash 299274822, now seen corresponding path program 1 times [2020-10-19 19:11:44,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:44,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397337288] [2020-10-19 19:11:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:44,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:44,570 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:49,748 WARN L193 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 224 DAG size of output: 172 [2020-10-19 19:11:50,346 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-19 19:11:50,349 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:11:50,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:11:50,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:11:50,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:11:50,350 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:11:50,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:50,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:11:50,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:11:50,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration10_Lasso [2020-10-19 19:11:50,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:11:50,350 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:11:50,355 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-19 19:11:50,363 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-19 19:11:50,365 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-19 19:11:50,368 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-19 19:11:50,370 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-19 19:11:50,373 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-19 19:11:50,382 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-19 19:11:50,384 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-19 19:11:50,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-19 19:11:50,389 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-19 19:11:50,393 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-19 19:11:50,396 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-19 19:11:50,399 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-19 19:11:50,403 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-19 19:11:50,405 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-19 19:11:50,409 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-19 19:11:50,413 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-19 19:11:50,416 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-19 19:11:50,420 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-19 19:11:50,424 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-19 19:11:50,837 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-10-19 19:11:50,860 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-19 19:11:50,863 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-19 19:11:50,867 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-19 19:11:50,870 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-19 19:11:50,872 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-19 19:11:50,875 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-19 19:11:50,877 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-19 19:11:50,880 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-19 19:11:50,882 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-19 19:11:50,884 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-19 19:11:50,885 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-19 19:11:50,889 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-19 19:11:51,316 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:11:51,316 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-19 19:11:51,325 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-19 19:11:51,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,329 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-19 19:11:51,330 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-19 19:11:51,365 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-19 19:11:51,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,370 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-19 19:11:51,410 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-19 19:11:51,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,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 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-19 19:11:51,468 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-19 19:11:51,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,478 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:51,502 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-19 19:11:51,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,508 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-19 19:11:51,530 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-19 19:11:51,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:51,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:51,538 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-19 19:11:51,562 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-19 19:11:51,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,569 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) [2020-10-19 19:11:51,596 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:51,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,605 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-19 19:11:51,631 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-19 19:11:51,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,635 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-19 19:11:51,662 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-19 19:11:51,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:51,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:51,669 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:51,692 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-19 19:11:51,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,696 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-19 19:11:51,719 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-19 19:11:51,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:51,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:51,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 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-19 19:11:51,757 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-19 19:11:51,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,761 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-19 19:11:51,783 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-19 19:11:51,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:51,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:51,794 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-19 19:11:51,818 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-19 19:11:51,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,822 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:51,846 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-19 19:11:51,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,853 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-19 19:11:51,888 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:51,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:51,892 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-19 19:11:51,915 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-19 19:11:51,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:51,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:51,922 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) [2020-10-19 19:11:51,944 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-19 19:11:51,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:51,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:51,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:51,948 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-19 19:11:51,970 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-19 19:11:51,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:51,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:51,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:51,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:51,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:51,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:51,977 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-19 19:11:52,002 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-19 19:11:52,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,010 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:52,032 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-19 19:11:52,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,047 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-19 19:11:52,073 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-19 19:11:52,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,080 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-19 19:11:52,104 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-19 19:11:52,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,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 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-19 19:11:52,133 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-19 19:11:52,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,138 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-19 19:11:52,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:11:52,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:52,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,163 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 19:11:52,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,164 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 19:11:52,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:52,167 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-19 19:11:52,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-19 19:11:52,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,197 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-19 19:11:52,219 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-19 19:11:52,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,233 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-19 19:11:52,257 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-19 19:11:52,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,267 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-19 19:11:52,289 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-19 19:11:52,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:11:52,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:11:52,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:11:52,293 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-19 19:11:52,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-19 19:11:52,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,323 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-19 19:11:52,349 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-19 19:11:52,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:11:52,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:11:52,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:11:52,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:11:52,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:11:52,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:11:52,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:11:52,403 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-19 19:11:52,403 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) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:52,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:11:52,407 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 19:11:52,408 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:11:52,408 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-19 19:11:52,480 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2020-10-19 19:11:52,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 19:11:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:52,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 19:11:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:52,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 19:11:52,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:11:52,608 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-19 19:11:52,608 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-19 19:11:52,608 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 19:11:52,703 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-19 19:11:52,703 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-19 19:11:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 19:11:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-10-19 19:11:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2020-10-19 19:11:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:11:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2020-10-19 19:11:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:11:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2020-10-19 19:11:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:11:52,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2020-10-19 19:11:52,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:11:52,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2020-10-19 19:11:52,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 19:11:52,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 19:11:52,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2020-10-19 19:11:52,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:11:52,710 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2020-10-19 19:11:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2020-10-19 19:11:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-10-19 19:11:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-19 19:11:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2020-10-19 19:11:52,714 INFO L714 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2020-10-19 19:11:52,714 INFO L594 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2020-10-19 19:11:52,714 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 19:11:52,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2020-10-19 19:11:52,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:11:52,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:52,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:52,718 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:11:52,718 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:11:52,718 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-19 19:11:52,719 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-19 19:11:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2020-10-19 19:11:52,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:52,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150767287] [2020-10-19 19:11:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:52,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:52,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:52,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:52,755 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2020-10-19 19:11:52,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:52,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861534747] [2020-10-19 19:11:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:52,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:52,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:52,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:52,762 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2020-10-19 19:11:52,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:52,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518537761] [2020-10-19 19:11:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:11:52,892 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-19 19:11:52,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518537761] [2020-10-19 19:11:52,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:11:52,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-19 19:11:52,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852167104] [2020-10-19 19:11:52,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:11:52,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 19:11:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-19 19:11:52,944 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2020-10-19 19:11:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:11:53,113 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2020-10-19 19:11:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:11:53,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2020-10-19 19:11:53,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-19 19:11:53,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2020-10-19 19:11:53,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-19 19:11:53,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 19:11:53,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2020-10-19 19:11:53,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:11:53,116 INFO L691 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2020-10-19 19:11:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2020-10-19 19:11:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2020-10-19 19:11:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-19 19:11:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2020-10-19 19:11:53,119 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2020-10-19 19:11:53,119 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2020-10-19 19:11:53,119 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 19:11:53,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2020-10-19 19:11:53,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:11:53,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:11:53,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:11:53,121 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:11:53,121 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:11:53,121 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-19 19:11:53,122 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-19 19:11:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -159704087, now seen corresponding path program 1 times [2020-10-19 19:11:53,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:53,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904430561] [2020-10-19 19:11:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:53,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:53,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:53,156 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2020-10-19 19:11:53,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:53,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105042958] [2020-10-19 19:11:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:53,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:53,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:53,163 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:11:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:11:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1079341024, now seen corresponding path program 1 times [2020-10-19 19:11:53,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:11:53,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277692856] [2020-10-19 19:11:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:11:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:53,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:11:53,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:11:53,198 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:00,568 WARN L193 SmtUtils]: Spent 7.32 s on a formula simplification. DAG size of input: 266 DAG size of output: 198 [2020-10-19 19:12:01,305 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-19 19:12:01,308 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:12:01,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:12:01,308 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:12:01,308 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:12:01,308 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:12:01,308 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:01,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:12:01,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:12:01,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2020-10-19 19:12:01,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:12:01,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:12:01,312 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-19 19:12:01,320 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-19 19:12:01,322 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-19 19:12:01,326 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-19 19:12:01,329 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-19 19:12:01,331 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-19 19:12:01,334 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-19 19:12:01,338 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-19 19:12:01,341 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-19 19:12:01,344 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-19 19:12:01,347 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-19 19:12:01,351 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-19 19:12:01,353 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-19 19:12:01,357 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-19 19:12:01,360 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-19 19:12:01,363 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-19 19:12:01,365 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-19 19:12:01,368 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-19 19:12:01,371 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-19 19:12:01,382 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-19 19:12:01,385 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-19 19:12:01,387 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-19 19:12:01,390 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-19 19:12:01,393 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-19 19:12:01,395 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-19 19:12:01,403 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-19 19:12:01,406 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-19 19:12:01,939 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-10-19 19:12:01,977 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-19 19:12:01,981 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-19 19:12:01,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-19 19:12:02,507 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:12:02,508 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-19 19:12:02,515 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-19 19:12:02,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,519 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-19 19:12:02,542 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-19 19:12:02,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,545 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) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:02,568 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-19 19:12:02,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:02,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:02,574 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-19 19:12:02,596 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-19 19:12:02,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,599 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-19 19:12:02,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:12:02,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,627 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-19 19:12:02,651 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-19 19:12:02,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,654 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-19 19:12:02,676 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-19 19:12:02,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,679 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-19 19:12:02,703 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-19 19:12:02,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:02,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:02,714 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-19 19:12:02,739 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-19 19:12:02,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,743 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-19 19:12:02,767 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-19 19:12:02,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,770 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-19 19:12:02,795 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-19 19:12:02,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:02,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:02,800 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) [2020-10-19 19:12:02,825 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:02,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,828 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-19 19:12:02,850 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-19 19:12:02,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,854 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-19 19:12:02,880 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-19 19:12:02,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,883 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-19 19:12:02,906 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-19 19:12:02,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:02,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:02,912 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-19 19:12:02,934 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-19 19:12:02,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,938 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-19 19:12:02,962 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-19 19:12:02,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:02,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:02,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:02,966 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-19 19:12:02,989 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-19 19:12:02,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:02,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:02,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:02,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:02,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:02,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:02,995 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-19 19:12:03,018 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-19 19:12:03,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,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 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-19 19:12:03,044 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-19 19:12:03,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,047 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) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:03,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:12:03,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,073 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-19 19:12:03,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-19 19:12:03,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,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 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-19 19:12:03,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-19 19:12:03,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,125 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-19 19:12:03,149 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-19 19:12:03,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,152 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-19 19:12:03,176 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-19 19:12:03,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,182 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-19 19:12:03,205 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-19 19:12:03,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,208 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-19 19:12:03,230 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-19 19:12:03,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,241 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-19 19:12:03,272 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-19 19:12:03,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12: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 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-19 19:12:03,300 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-19 19:12:03,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,307 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-19 19:12:03,330 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-19 19:12:03,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,337 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-19 19:12:03,362 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-19 19:12:03,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,368 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-19 19:12:03,390 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-19 19:12:03,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,397 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-19 19:12:03,419 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-19 19:12:03,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,430 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) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:03,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-19 19:12:03,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,464 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-19 19:12:03,486 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-19 19:12:03,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,499 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) [2020-10-19 19:12:03,534 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-19 19:12:03,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:03,543 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) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:03,567 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-19 19:12:03,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,573 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-19 19:12:03,596 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-19 19:12:03,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,599 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-19 19:12:03,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-19 19:12:03,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:03,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:03,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:03,624 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) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:03,648 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-19 19:12:03,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,649 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 19:12:03,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,651 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 19:12:03,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,658 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-19 19:12:03,688 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-19 19:12:03,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:03,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:03,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:03,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:03,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:03,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:03,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:12:03,745 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-19 19:12:03,745 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-19 19:12:03,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:12:03,750 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:12:03,750 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:12:03,750 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0, #t~string0.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2) = -1*ULTIMATE.start_parse_expression_list_~start~0 - 1*#t~string0.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 Supporting invariants [] [2020-10-19 19:12:03,854 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2020-10-19 19:12:03,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 19:12:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:03,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 19:12:03,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:12:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:03,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:12:03,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:12:03,999 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-19 19:12:03,999 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-19 19:12:03,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 6 states. [2020-10-19 19:12:04,166 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-19 19:12:04,167 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-19 19:12:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 19:12:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-10-19 19:12:04,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 19:12:04,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:12:04,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2020-10-19 19:12:04,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:12:04,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2020-10-19 19:12:04,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:12:04,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2020-10-19 19:12:04,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-10-19 19:12:04,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2020-10-19 19:12:04,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-19 19:12:04,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-19 19:12:04,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2020-10-19 19:12:04,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:04,176 INFO L691 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2020-10-19 19:12:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2020-10-19 19:12:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2020-10-19 19:12:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-19 19:12:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2020-10-19 19:12:04,181 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2020-10-19 19:12:04,181 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2020-10-19 19:12:04,181 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 19:12:04,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2020-10-19 19:12:04,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:04,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:04,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:04,183 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:12:04,183 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:12:04,184 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-19 19:12:04,184 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15;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-19 19:12:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2020-10-19 19:12:04,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:04,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107126177] [2020-10-19 19:12:04,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:04,404 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-19 19:12:04,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107126177] [2020-10-19 19:12:04,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:12:04,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-19 19:12:04,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193125963] [2020-10-19 19:12:04,406 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:12:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2020-10-19 19:12:04,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:04,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224328365] [2020-10-19 19:12:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:04,423 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-19 19:12:04,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224328365] [2020-10-19 19:12:04,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:12:04,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 19:12:04,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612035891] [2020-10-19 19:12:04,424 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:12:04,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:12:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:12:04,430 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2020-10-19 19:12:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:04,445 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2020-10-19 19:12:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:12:04,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2020-10-19 19:12:04,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:04,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2020-10-19 19:12:04,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-19 19:12:04,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 19:12:04,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2020-10-19 19:12:04,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:04,449 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2020-10-19 19:12:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2020-10-19 19:12:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-19 19:12:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-19 19:12:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2020-10-19 19:12:04,453 INFO L714 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2020-10-19 19:12:04,453 INFO L594 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2020-10-19 19:12:04,453 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 19:12:04,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2020-10-19 19:12:04,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:04,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:04,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:04,455 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:12:04,455 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:12:04,455 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-19 19:12:04,455 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15;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-19 19:12:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 2 times [2020-10-19 19:12:04,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:04,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070812448] [2020-10-19 19:12:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:04,617 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-19 19:12:04,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070812448] [2020-10-19 19:12:04,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:12:04,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-19 19:12:04,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147443994] [2020-10-19 19:12:04,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:12:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2020-10-19 19:12:04,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:04,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223641646] [2020-10-19 19:12:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:04,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:04,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:04,625 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:04,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 19:12:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-19 19:12:04,724 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 8 states. [2020-10-19 19:12:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:04,949 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2020-10-19 19:12:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:12:04,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2020-10-19 19:12:04,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-19 19:12:04,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 117 states and 151 transitions. [2020-10-19 19:12:04,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-10-19 19:12:04,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-10-19 19:12:04,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 151 transitions. [2020-10-19 19:12:04,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:04,955 INFO L691 BuchiCegarLoop]: Abstraction has 117 states and 151 transitions. [2020-10-19 19:12:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 151 transitions. [2020-10-19 19:12:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2020-10-19 19:12:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-19 19:12:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2020-10-19 19:12:04,962 INFO L714 BuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2020-10-19 19:12:04,962 INFO L594 BuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2020-10-19 19:12:04,962 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 19:12:04,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 116 transitions. [2020-10-19 19:12:04,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:04,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:04,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:04,968 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:12:04,968 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:12:04,968 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-19 19:12:04,969 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15;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-19 19:12:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2020-10-19 19:12:04,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:04,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972450569] [2020-10-19 19:12:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:04,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2020-10-19 19:12:05,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769097686] [2020-10-19 19:12:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,039 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2020-10-19 19:12:05,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631038454] [2020-10-19 19:12:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:05,096 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-19 19:12:05,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631038454] [2020-10-19 19:12:05,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:12:05,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 19:12:05,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744144365] [2020-10-19 19:12:05,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:12:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:12:05,211 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. cyclomatic complexity: 35 Second operand 6 states. [2020-10-19 19:12:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:05,349 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2020-10-19 19:12:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:12:05,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 172 transitions. [2020-10-19 19:12:05,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 19:12:05,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 127 states and 164 transitions. [2020-10-19 19:12:05,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-19 19:12:05,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-19 19:12:05,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 164 transitions. [2020-10-19 19:12:05,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:05,355 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 164 transitions. [2020-10-19 19:12:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 164 transitions. [2020-10-19 19:12:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2020-10-19 19:12:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-19 19:12:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2020-10-19 19:12:05,359 INFO L714 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2020-10-19 19:12:05,359 INFO L594 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2020-10-19 19:12:05,359 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-19 19:12:05,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2020-10-19 19:12:05,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:05,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:05,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:05,361 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-19 19:12:05,362 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:12:05,362 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-19 19:12:05,362 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15;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-19 19:12:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1769863882, now seen corresponding path program 1 times [2020-10-19 19:12:05,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371435158] [2020-10-19 19:12:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2020-10-19 19:12:05,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072295877] [2020-10-19 19:12:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,411 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 311030449, now seen corresponding path program 1 times [2020-10-19 19:12:05,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94597100] [2020-10-19 19:12:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:05,473 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-19 19:12:05,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94597100] [2020-10-19 19:12:05,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858163693] [2020-10-19 19:12:05,473 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-19 19:12:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:05,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:12:05,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:12:05,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:12:05,551 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-19 19:12:05,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:12:05,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-19 19:12:05,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182020888] [2020-10-19 19:12:05,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 19:12:05,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-19 19:12:05,633 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 34 Second operand 7 states. [2020-10-19 19:12:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:05,799 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2020-10-19 19:12:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:12:05,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 239 transitions. [2020-10-19 19:12:05,802 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-19 19:12:05,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 167 states and 217 transitions. [2020-10-19 19:12:05,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-19 19:12:05,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-19 19:12:05,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 217 transitions. [2020-10-19 19:12:05,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:05,805 INFO L691 BuchiCegarLoop]: Abstraction has 167 states and 217 transitions. [2020-10-19 19:12:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 217 transitions. [2020-10-19 19:12:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 132. [2020-10-19 19:12:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-19 19:12:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2020-10-19 19:12:05,809 INFO L714 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2020-10-19 19:12:05,809 INFO L594 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2020-10-19 19:12:05,809 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-19 19:12:05,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 172 transitions. [2020-10-19 19:12:05,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 19:12:05,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:05,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:05,811 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-19 19:12:05,812 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:12:05,812 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-19 19:12:05,812 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15;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-19 19:12:05,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1800242060, now seen corresponding path program 1 times [2020-10-19 19:12:05,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425544360] [2020-10-19 19:12:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,860 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:05,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 4 times [2020-10-19 19:12:05,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280107341] [2020-10-19 19:12:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,867 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 436075035, now seen corresponding path program 1 times [2020-10-19 19:12:05,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:05,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081031048] [2020-10-19 19:12:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:05,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:05,921 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:15,615 WARN L193 SmtUtils]: Spent 9.61 s on a formula simplification. DAG size of input: 321 DAG size of output: 226 [2020-10-19 19:12:16,362 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-19 19:12:16,366 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:12:16,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:12:16,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:12:16,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:12:16,366 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:12:16,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:16,366 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:12:16,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:12:16,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration17_Lasso [2020-10-19 19:12:16,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:12:16,367 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:12:16,370 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-19 19:12:16,373 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-19 19:12:16,377 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-19 19:12:16,381 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-19 19:12:16,385 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-19 19:12:16,389 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-19 19:12:16,392 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-19 19:12:16,397 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-19 19:12:16,400 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-19 19:12:16,403 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-19 19:12:16,407 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-19 19:12:16,410 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-19 19:12:16,414 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-19 19:12:16,418 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-19 19:12:16,422 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-19 19:12:16,426 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-19 19:12:17,104 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-10-19 19:12:17,180 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-19 19:12:17,186 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-19 19:12:17,189 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-19 19:12:17,193 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-19 19:12:17,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-19 19:12:17,200 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-19 19:12:17,202 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-19 19:12:17,205 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-19 19:12:17,208 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-19 19:12:17,211 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-19 19:12:17,214 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-19 19:12:17,222 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-19 19:12:17,225 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-19 19:12:17,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-19 19:12:17,800 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:12:17,801 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-19 19:12:17,805 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-19 19:12:17,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:17,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:17,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:17,809 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-19 19:12:17,831 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-19 19:12:17,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:17,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:17,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:17,841 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-19 19:12:17,865 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-19 19:12:17,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:17,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:17,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:17,868 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) Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:17,891 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-19 19:12:17,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:17,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:17,897 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-19 19:12:17,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-19 19:12:17,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:17,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:17,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 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-19 19:12:17,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-19 19:12:17,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:17,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:17,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:17,959 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-19 19:12:17,983 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-19 19:12:17,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:17,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:17,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:17,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:17,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:17,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:17,989 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-19 19:12:18,012 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-19 19:12:18,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,016 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-19 19:12:18,039 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-19 19:12:18,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,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 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-19 19:12:18,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:12:18,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,067 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-19 19:12:18,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-19 19:12:18,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,092 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-19 19:12:18,114 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-19 19:12:18,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,120 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-19 19:12:18,141 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-19 19:12:18,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,145 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-19 19:12:18,168 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-19 19:12:18,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,171 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-19 19:12:18,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:12:18,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,202 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) [2020-10-19 19:12:18,225 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-19 19:12:18,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:12:18,232 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-19 19:12:18,254 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-19 19:12:18,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:12:18,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:12:18,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:12:18,257 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-19 19:12:18,280 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-19 19:12:18,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,287 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-19 19:12:18,310 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-19 19:12:18,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,315 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-19 19:12:18,338 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-19 19:12:18,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,344 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-19 19:12:18,366 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-19 19:12:18,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,373 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-19 19:12:18,395 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-19 19:12:18,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,401 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-19 19:12:18,423 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-19 19:12:18,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,435 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-19 19:12:18,458 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-19 19:12:18,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,468 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-19 19:12:18,490 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-19 19:12:18,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:12:18,496 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-19 19:12:18,533 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-19 19:12:18,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:12:18,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:12:18,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:12:18,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:12:18,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:12:18,542 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-19 19:12:18,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:12:18,585 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-19 19:12:18,585 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-19 19:12:18,591 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-19 19:12:18,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:12:18,595 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:12:18,595 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-19 19:12:18,719 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2020-10-19 19:12:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:18,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:12:18,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:12:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:18,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 19:12:18,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:12:18,848 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-19 19:12:18,848 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-19 19:12:18,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50 Second operand 4 states. [2020-10-19 19:12:19,025 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-19 19:12:19,026 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-19 19:12:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 19:12:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2020-10-19 19:12:19,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2020-10-19 19:12:19,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:12:19,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2020-10-19 19:12:19,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:12:19,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2020-10-19 19:12:19,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:12:19,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 386 transitions. [2020-10-19 19:12:19,031 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2020-10-19 19:12:19,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 192 states and 251 transitions. [2020-10-19 19:12:19,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-19 19:12:19,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-19 19:12:19,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 251 transitions. [2020-10-19 19:12:19,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:19,035 INFO L691 BuchiCegarLoop]: Abstraction has 192 states and 251 transitions. [2020-10-19 19:12:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 251 transitions. [2020-10-19 19:12:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2020-10-19 19:12:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-19 19:12:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2020-10-19 19:12:19,040 INFO L714 BuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2020-10-19 19:12:19,040 INFO L594 BuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2020-10-19 19:12:19,040 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-19 19:12:19,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 179 transitions. [2020-10-19 19:12:19,041 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-19 19:12:19,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:19,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:19,043 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-19 19:12:19,044 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:12:19,047 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15; 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-19 19:12:19,047 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-19 19:12:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash -457267248, now seen corresponding path program 1 times [2020-10-19 19:12:19,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:19,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785267436] [2020-10-19 19:12:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:19,162 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-19 19:12:19,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785267436] [2020-10-19 19:12:19,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:12:19,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:12:19,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753744225] [2020-10-19 19:12:19,163 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:12:19,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2020-10-19 19:12:19,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:19,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160898843] [2020-10-19 19:12:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:19,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:19,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:19,170 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:19,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:12:19,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:12:19,231 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. cyclomatic complexity: 51 Second operand 5 states. [2020-10-19 19:12:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:19,367 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2020-10-19 19:12:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:12:19,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 182 transitions. [2020-10-19 19:12:19,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:19,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 127 states and 167 transitions. [2020-10-19 19:12:19,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 19:12:19,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 19:12:19,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 167 transitions. [2020-10-19 19:12:19,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:19,373 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. [2020-10-19 19:12:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 167 transitions. [2020-10-19 19:12:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-10-19 19:12:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-19 19:12:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2020-10-19 19:12:19,375 INFO L714 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2020-10-19 19:12:19,376 INFO L594 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2020-10-19 19:12:19,376 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-19 19:12:19,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2020-10-19 19:12:19,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:19,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:19,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:19,378 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-19 19:12:19,378 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:12:19,378 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15; 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-19 19:12:19,379 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-19 19:12:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1498929950, now seen corresponding path program 1 times [2020-10-19 19:12:19,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:19,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603947693] [2020-10-19 19:12:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:19,440 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-19 19:12:19,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603947693] [2020-10-19 19:12:19,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:12:19,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 19:12:19,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442557024] [2020-10-19 19:12:19,442 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:12:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2020-10-19 19:12:19,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:19,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030283312] [2020-10-19 19:12:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:19,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:19,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:19,449 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:19,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:12:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:12:19,505 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 6 states. [2020-10-19 19:12:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:19,699 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2020-10-19 19:12:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:12:19,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 215 transitions. [2020-10-19 19:12:19,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:19,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 144 states and 185 transitions. [2020-10-19 19:12:19,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 19:12:19,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 19:12:19,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 185 transitions. [2020-10-19 19:12:19,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:12:19,704 INFO L691 BuchiCegarLoop]: Abstraction has 144 states and 185 transitions. [2020-10-19 19:12:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 185 transitions. [2020-10-19 19:12:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 115. [2020-10-19 19:12:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-19 19:12:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2020-10-19 19:12:19,707 INFO L714 BuchiCegarLoop]: Abstraction has 115 states and 149 transitions. [2020-10-19 19:12:19,708 INFO L594 BuchiCegarLoop]: Abstraction has 115 states and 149 transitions. [2020-10-19 19:12:19,708 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-19 19:12:19,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 149 transitions. [2020-10-19 19:12:19,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-19 19:12:19,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:12:19,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:12:19,710 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-19 19:12:19,710 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:12:19,710 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~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~mem15; 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-19 19:12:19,711 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-19 19:12:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1107093604, now seen corresponding path program 1 times [2020-10-19 19:12:19,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:19,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090824289] [2020-10-19 19:12:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:19,824 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-19 19:12:19,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090824289] [2020-10-19 19:12:19,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111087164] [2020-10-19 19:12:19,824 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-19 19:12:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:12:19,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-19 19:12:19,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:12:19,916 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-19 19:12:19,917 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:12:19,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:12:19,920 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:12:19,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-19 19:12:19,936 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:12:19,937 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-19 19:12:19,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:12:19,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:12:19,940 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:12:19,940 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-19 19:12:20,009 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-19 19:12:20,009 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:12:20,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:12:20,020 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-19 19:12:20,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2020-10-19 19:12:20,080 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-19 19:12:20,082 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:12:20,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:12:20,090 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-19 19:12:20,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2020-10-19 19:12:20,100 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-19 19:12:20,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:12:20,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-10-19 19:12:20,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916811997] [2020-10-19 19:12:20,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:12:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:12:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2020-10-19 19:12:20,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:12:20,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381201862] [2020-10-19 19:12:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:12:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:20,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:12:20,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:12:20,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:12:20,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:12:20,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 19:12:20,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-19 19:12:20,164 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. cyclomatic complexity: 42 Second operand 10 states. [2020-10-19 19:12:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:12:20,434 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2020-10-19 19:12:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:12:20,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 112 transitions. [2020-10-19 19:12:20,436 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:12:20,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2020-10-19 19:12:20,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 19:12:20,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 19:12:20,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 19:12:20,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:12:20,436 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:12:20,436 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:12:20,436 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:12:20,436 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-19 19:12:20,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 19:12:20,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:12:20,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 19:12:20,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 07:12:20 BoogieIcfgContainer [2020-10-19 19:12:20,442 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 19:12:20,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 19:12:20,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 19:12:20,443 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 19:12:20,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:11:40" (3/4) ... [2020-10-19 19:12:20,446 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 19:12:20,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 19:12:20,448 INFO L168 Benchmark]: Toolchain (without parser) took 41042.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 960.0 MB in the beginning and 871.4 MB in the end (delta: 88.5 MB). Peak memory consumption was 471.3 MB. Max. memory is 11.5 GB. [2020-10-19 19:12:20,448 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:12:20,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-10-19 19:12:20,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:12:20,450 INFO L168 Benchmark]: Boogie Preprocessor took 40.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:12:20,450 INFO L168 Benchmark]: RCFGBuilder took 439.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2020-10-19 19:12:20,451 INFO L168 Benchmark]: BuchiAutomizer took 40049.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.1 GB in the beginning and 871.4 MB in the end (delta: 215.0 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. [2020-10-19 19:12:20,451 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 1.4 GB. Free memory is still 871.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:12:20,453 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 424.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40049.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.1 GB in the beginning and 871.4 MB in the end (delta: 215.0 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.00 ms. Allocated memory is still 1.4 GB. Free memory is still 871.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (16 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 15 * unknown-#length-unknown[A] 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 -1 * start + -1 * "0" + unknown-#length-unknown[str] 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 39.9s and 21 iterations. TraceHistogramMax:8. Analysis of lassos took 36.8s. Construction of modules took 0.9s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 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, 0.9s 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: 12ms 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...