./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/verisec_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 8770e865452d763f6a1ae70a92c5caf41552c1e5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:04:55,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:04:55,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:04:55,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:04:55,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:04:55,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:04:55,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:04:55,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:04:55,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:04:55,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:04:55,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:04:55,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:04:55,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:04:55,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:04:55,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:04:55,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:04:55,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:04:55,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:04:55,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:04:55,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:04:55,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:04:55,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:04:55,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:04:55,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:04:55,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:04:55,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:04:55,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:04:55,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:04:55,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:04:55,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:04:55,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:04:55,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:04:55,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:04:55,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:04:55,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:04:55,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:04:55,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:04:55,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:04:55,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:04:55,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:04:55,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:04:55,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:04:55,185 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:04:55,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:04:55,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:04:55,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:04:55,189 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:04:55,190 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:04:55,190 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:04:55,190 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:04:55,190 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:04:55,190 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:04:55,191 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:04:55,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:04:55,192 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:04:55,192 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:04:55,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:04:55,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:04:55,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:04:55,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:04:55,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:04:55,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:04:55,194 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:04:55,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:04:55,194 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:04:55,195 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:04:55,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:04:55,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:04:55,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:04:55,195 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:04:55,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:04:55,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:04:55,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:04:55,196 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:04:55,198 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:04:55,198 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 -> 8770e865452d763f6a1ae70a92c5caf41552c1e5 [2020-10-20 07:04:55,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:04:55,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:04:55,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:04:55,452 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:04:55,453 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:04:55,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-20 07:04:55,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cae60b4/7c3c361300e24d3ea7bd0952ad1d9b04/FLAGe5e18bf2f [2020-10-20 07:04:55,966 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:04:55,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-20 07:04:55,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cae60b4/7c3c361300e24d3ea7bd0952ad1d9b04/FLAGe5e18bf2f [2020-10-20 07:04:56,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cae60b4/7c3c361300e24d3ea7bd0952ad1d9b04 [2020-10-20 07:04:56,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:04:56,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:04:56,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:04:56,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:04:56,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:04:56,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8dd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56, skipping insertion in model container [2020-10-20 07:04:56,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:04:56,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:04:56,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:04:56,791 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:04:56,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:04:56,848 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:04:56,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56 WrapperNode [2020-10-20 07:04:56,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:04:56,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:04:56,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:04:56,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:04:56,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:04:56,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:04:56,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:04:56,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:04:56,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... [2020-10-20 07:04:56,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:04:56,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:04:56,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:04:56,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:04:56,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:04:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:04:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:04:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:04:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-10-20 07:04:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:04:57,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:04:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:04:57,434 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:04:57,434 INFO L298 CfgBuilder]: Removed 15 assume(true) statements. [2020-10-20 07:04:57,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:04:57 BoogieIcfgContainer [2020-10-20 07:04:57,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:04:57,437 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:04:57,437 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:04:57,440 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:04:57,441 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:04:57,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:04:56" (1/3) ... [2020-10-20 07:04:57,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@523d43fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:04:57, skipping insertion in model container [2020-10-20 07:04:57,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:04:57,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:04:56" (2/3) ... [2020-10-20 07:04:57,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@523d43fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:04:57, skipping insertion in model container [2020-10-20 07:04:57,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:04:57,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:04:57" (3/3) ... [2020-10-20 07:04:57,445 INFO L373 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-20 07:04:57,498 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:04:57,499 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:04:57,499 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:04:57,499 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:04:57,500 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:04:57,500 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:04:57,500 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:04:57,500 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:04:57,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-10-20 07:04:57,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-20 07:04:57,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:57,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:57,548 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:04:57,548 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:57,548 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:04:57,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-10-20 07:04:57,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-20 07:04:57,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:57,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:57,552 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:04:57,552 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:57,559 INFO L794 eck$LassoCheckResult]: Stem: 32#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); 9#L-1true havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 28#L61true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L62-4true [2020-10-20 07:04:57,559 INFO L796 eck$LassoCheckResult]: Loop: 3#L62-4true 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; 12#L65true assume !parse_expression_list_#t~switch7; 33#L64true havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 8#L62-1true call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L62-2true assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 3#L62-4true [2020-10-20 07:04:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-20 07:04:57,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:57,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747076189] [2020-10-20 07:04:57,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:57,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:57,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:57,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash 42114609, now seen corresponding path program 1 times [2020-10-20 07:04:57,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:57,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908230991] [2020-10-20 07:04:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:57,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:57,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:57,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 181442414, now seen corresponding path program 1 times [2020-10-20 07:04:57,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:57,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827379143] [2020-10-20 07:04:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:57,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:57,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:57,845 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:58,392 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2020-10-20 07:04:58,548 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-20 07:04:58,561 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:04:58,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:04:58,562 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:04:58,562 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:04:58,562 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:04:58,562 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:58,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:04:58,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:04:58,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2020-10-20 07:04:58,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:04:58,564 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:04:58,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,919 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-20 07:04:58,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:58,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:59,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:59,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:59,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:59,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:59,429 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:04:59,434 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-20 07:04:59,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:59,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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,539 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 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-20 07:04:59,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,581 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 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,621 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:59,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,660 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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,702 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,736 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,784 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,825 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,862 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:59,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:59,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:59,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:04:59,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:59,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-20 07:04:59,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:59,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:59,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:59,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:59,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:59,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:59,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 07:05:00,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:00,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:00,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:00,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:00,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:00,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:00,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:00,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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:00,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-20 07:05:00,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:00,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:00,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:00,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:00,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:00,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:00,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:05:00,268 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 07:05:00,268 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:00,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:05:00,276 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:05:00,277 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:05:00,277 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2020-10-20 07:05:00,374 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2020-10-20 07:05:00,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:05:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:00,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:05:00,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:00,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:05:00,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:00,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 07:05:00,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 4 states. [2020-10-20 07:05:00,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 4 states. Result 100 states and 141 transitions. Complement of second has 7 states. [2020-10-20 07:05:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:05:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:05:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2020-10-20 07:05:00,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 3 letters. Loop has 5 letters. [2020-10-20 07:05:00,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:00,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 8 letters. Loop has 5 letters. [2020-10-20 07:05:00,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:00,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 3 letters. Loop has 10 letters. [2020-10-20 07:05:00,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:00,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 141 transitions. [2020-10-20 07:05:00,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:00,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 40 states and 55 transitions. [2020-10-20 07:05:00,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:05:00,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 07:05:00,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2020-10-20 07:05:00,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:00,663 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2020-10-20 07:05:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2020-10-20 07:05:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-10-20 07:05:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 07:05:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-10-20 07:05:00,713 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-10-20 07:05:00,713 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-10-20 07:05:00,714 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:05:00,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2020-10-20 07:05:00,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:00,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:00,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:00,716 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:00,716 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:00,716 INFO L794 eck$LassoCheckResult]: Stem: 300#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); 278#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 279#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 263#L62-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; 264#L65 assume parse_expression_list_#t~switch7; 273#L66-5 [2020-10-20 07:05:00,717 INFO L796 eck$LassoCheckResult]: Loop: 273#L66-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; 274#L66-1 assume parse_expression_list_#t~short10; 298#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;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; 273#L66-5 [2020-10-20 07:05:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2020-10-20 07:05:00,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:00,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191448707] [2020-10-20 07:05:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:00,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:00,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:00,764 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-10-20 07:05:00,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:00,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136889686] [2020-10-20 07:05:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:00,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:00,774 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:00,776 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2020-10-20 07:05:00,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:00,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241958509] [2020-10-20 07:05:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:00,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241958509] [2020-10-20 07:05:00,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:00,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:00,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169156948] [2020-10-20 07:05:00,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:05:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:05:00,995 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2020-10-20 07:05:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:01,127 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2020-10-20 07:05:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:05:01,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2020-10-20 07:05:01,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-20 07:05:01,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2020-10-20 07:05:01,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 07:05:01,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-20 07:05:01,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2020-10-20 07:05:01,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:01,134 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2020-10-20 07:05:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2020-10-20 07:05:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-10-20 07:05:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-20 07:05:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2020-10-20 07:05:01,139 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-10-20 07:05:01,139 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-10-20 07:05:01,140 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:05:01,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2020-10-20 07:05:01,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:01,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:01,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:01,142 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:01,142 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:01,142 INFO L794 eck$LassoCheckResult]: Stem: 424#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); 402#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 403#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 386#L62-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; 387#L65 assume !parse_expression_list_#t~switch7; 396#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 401#L62-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); 390#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 388#L62-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; 389#L65 assume parse_expression_list_#t~switch7; 429#L66-5 [2020-10-20 07:05:01,142 INFO L796 eck$LassoCheckResult]: Loop: 429#L66-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; 430#L66-1 assume parse_expression_list_#t~short10; 431#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;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; 429#L66-5 [2020-10-20 07:05:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1727498927, now seen corresponding path program 1 times [2020-10-20 07:05:01,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:01,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957830024] [2020-10-20 07:05:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:01,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:01,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:01,183 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-10-20 07:05:01,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:01,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845123525] [2020-10-20 07:05:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:01,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:01,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:01,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1622374614, now seen corresponding path program 1 times [2020-10-20 07:05:01,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:01,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112248034] [2020-10-20 07:05:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:01,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:01,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:01,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:01,907 WARN L193 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 108 [2020-10-20 07:05:02,082 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-20 07:05:02,085 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:05:02,085 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:05:02,085 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:05:02,085 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:05:02,085 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:05:02,086 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:02,086 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:05:02,086 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:05:02,086 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2020-10-20 07:05:02,086 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:05:02,086 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:05:02,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,458 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-20 07:05:02,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:02,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:03,022 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:05:03,026 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05: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-20 07:05:03,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:03,048 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) [2020-10-20 07:05:03,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:03,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:03,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:03,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:03,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,114 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-20 07:05:03,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:03,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,147 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) [2020-10-20 07:05:03,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:03,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:03,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:03,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:03,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:03,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:03,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:05:03,254 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-20 07:05:03,254 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:03,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:05:03,269 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 07:05:03,269 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:05:03,270 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_~start~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str.offset >= 0] [2020-10-20 07:05:03,377 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2020-10-20 07:05:03,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:05:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:03,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:05:03,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:03,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:05:03,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:03,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 07:05:03,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-10-20 07:05:03,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 153 states and 213 transitions. Complement of second has 8 states. [2020-10-20 07:05:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:05:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:05:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-10-20 07:05:03,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-20 07:05:03,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:03,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2020-10-20 07:05:03,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:03,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 07:05:03,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:03,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2020-10-20 07:05:03,606 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-10-20 07:05:03,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2020-10-20 07:05:03,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-20 07:05:03,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-10-20 07:05:03,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2020-10-20 07:05:03,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:03,623 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2020-10-20 07:05:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2020-10-20 07:05:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2020-10-20 07:05:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 07:05:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2020-10-20 07:05:03,631 INFO L714 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-10-20 07:05:03,631 INFO L594 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-10-20 07:05:03,632 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:05:03,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2020-10-20 07:05:03,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:03,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:03,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:03,634 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:03,635 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:03,635 INFO L794 eck$LassoCheckResult]: Stem: 807#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); 779#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 780#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 759#L62-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; 760#L65 assume parse_expression_list_#t~switch7; 771#L66-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; 772#L66-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; 830#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 765#L66-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); 766#L67 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; 788#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 782#L69-8 [2020-10-20 07:05:03,635 INFO L796 eck$LassoCheckResult]: Loop: 782#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 798#L69-1 assume !parse_expression_list_#t~short17; 781#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;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; 782#L69-8 [2020-10-20 07:05:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2020-10-20 07:05:03,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:03,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088092216] [2020-10-20 07:05:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:03,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088092216] [2020-10-20 07:05:03,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:03,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:03,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255262348] [2020-10-20 07:05:03,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2020-10-20 07:05:03,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:03,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583636081] [2020-10-20 07:05:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:03,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583636081] [2020-10-20 07:05:03,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:03,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:05:03,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281367195] [2020-10-20 07:05:03,816 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:05:03,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:05:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:05:03,817 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-10-20 07:05:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:03,828 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2020-10-20 07:05:03,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:05:03,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2020-10-20 07:05:03,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:03,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2020-10-20 07:05:03,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 07:05:03,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-20 07:05:03,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2020-10-20 07:05:03,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:03,832 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-10-20 07:05:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2020-10-20 07:05:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-20 07:05:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-20 07:05:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2020-10-20 07:05:03,838 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-10-20 07:05:03,838 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-10-20 07:05:03,838 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:05:03,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2020-10-20 07:05:03,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:03,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:03,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:03,840 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:03,841 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:03,841 INFO L794 eck$LassoCheckResult]: Stem: 958#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); 933#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 934#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 915#L62-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; 916#L65 assume parse_expression_list_#t~switch7; 973#L66-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; 972#L66-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; 970#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 965#L66-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); 962#L67 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; 940#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 936#L69-8 [2020-10-20 07:05:03,841 INFO L796 eck$LassoCheckResult]: Loop: 936#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 951#L69-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; 948#L69-2 assume parse_expression_list_#t~short16; 943#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 935#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;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; 936#L69-8 [2020-10-20 07:05:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 2 times [2020-10-20 07:05:03,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:03,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527436571] [2020-10-20 07:05:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:04,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527436571] [2020-10-20 07:05:04,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:04,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:04,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997206753] [2020-10-20 07:05:04,003 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,003 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2020-10-20 07:05:04,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389213796] [2020-10-20 07:05:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:05:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:05:04,103 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2020-10-20 07:05:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:04,216 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2020-10-20 07:05:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:05:04,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2020-10-20 07:05:04,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-20 07:05:04,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2020-10-20 07:05:04,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 07:05:04,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 07:05:04,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2020-10-20 07:05:04,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:04,220 INFO L691 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2020-10-20 07:05:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2020-10-20 07:05:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2020-10-20 07:05:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 07:05:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2020-10-20 07:05:04,226 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2020-10-20 07:05:04,227 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2020-10-20 07:05:04,227 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:05:04,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2020-10-20 07:05:04,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:04,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:04,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:04,229 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:04,229 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:04,229 INFO L794 eck$LassoCheckResult]: Stem: 1145#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); 1125#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1126#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1104#L62-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; 1105#L65 assume parse_expression_list_#t~switch7; 1115#L66-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; 1116#L66-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; 1143#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 1108#L66-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); 1109#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 1127#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1122#L69-8 [2020-10-20 07:05:04,229 INFO L796 eck$LassoCheckResult]: Loop: 1122#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1138#L69-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; 1135#L69-2 assume parse_expression_list_#t~short16; 1130#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1121#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;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; 1122#L69-8 [2020-10-20 07:05:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2020-10-20 07:05:04,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80500960] [2020-10-20 07:05:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,254 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2020-10-20 07:05:04,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856553505] [2020-10-20 07:05:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,263 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2020-10-20 07:05:04,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226022605] [2020-10-20 07:05:04,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:04,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226022605] [2020-10-20 07:05:04,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:04,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:04,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577257306] [2020-10-20 07:05:04,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:05:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:05:04,373 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. cyclomatic complexity: 33 Second operand 6 states. [2020-10-20 07:05:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:04,483 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2020-10-20 07:05:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:05:04,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2020-10-20 07:05:04,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 07:05:04,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2020-10-20 07:05:04,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 07:05:04,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 07:05:04,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2020-10-20 07:05:04,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:04,488 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2020-10-20 07:05:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2020-10-20 07:05:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-10-20 07:05:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-20 07:05:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2020-10-20 07:05:04,493 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2020-10-20 07:05:04,493 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2020-10-20 07:05:04,494 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:05:04,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2020-10-20 07:05:04,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:04,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:04,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:04,495 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:04,496 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:04,496 INFO L794 eck$LassoCheckResult]: Stem: 1345#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); 1321#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1322#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1305#L62-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; 1306#L65 assume !parse_expression_list_#t~switch7; 1363#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 1374#L62-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); 1373#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1370#L62-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; 1362#L65 assume parse_expression_list_#t~switch7; 1364#L66-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; 1371#L66-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; 1367#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 1368#L66-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); 1376#L67 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; 1328#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1324#L69-8 [2020-10-20 07:05:04,496 INFO L796 eck$LassoCheckResult]: Loop: 1324#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1338#L69-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; 1335#L69-2 assume parse_expression_list_#t~short16; 1331#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1323#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;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; 1324#L69-8 [2020-10-20 07:05:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash -893322464, now seen corresponding path program 1 times [2020-10-20 07:05:04,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038782424] [2020-10-20 07:05:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,525 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2020-10-20 07:05:04,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783537502] [2020-10-20 07:05:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:04,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:04,534 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1994277497, now seen corresponding path program 1 times [2020-10-20 07:05:04,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192498357] [2020-10-20 07:05:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:04,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192498357] [2020-10-20 07:05:04,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031547936] [2020-10-20 07:05:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:05:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:04,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:05:04,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:04,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:05:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:04,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:05:04,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 07:05:04,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117222467] [2020-10-20 07:05:04,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:05:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:05:04,813 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 32 Second operand 7 states. [2020-10-20 07:05:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:04,949 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2020-10-20 07:05:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:05:04,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2020-10-20 07:05:04,953 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-20 07:05:04,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2020-10-20 07:05:04,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-20 07:05:04,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-20 07:05:04,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2020-10-20 07:05:04,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:04,958 INFO L691 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2020-10-20 07:05:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2020-10-20 07:05:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2020-10-20 07:05:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-20 07:05:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2020-10-20 07:05:04,976 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2020-10-20 07:05:04,976 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2020-10-20 07:05:04,977 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:05:04,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2020-10-20 07:05:04,978 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 07:05:04,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:04,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:04,979 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:04,979 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:05:04,980 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); 1643#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1644#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1621#L62-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; 1622#L65 assume !parse_expression_list_#t~switch7; 1651#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 1727#L62-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); 1726#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1623#L62-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; 1624#L65 assume !parse_expression_list_#t~switch7; 1709#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 1715#L62-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); 1714#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1711#L62-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; 1708#L65 assume parse_expression_list_#t~switch7; 1710#L66-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; 1637#L66-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; 1724#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 1725#L66-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); 1728#L67 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; 1645#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1640#L69-8 [2020-10-20 07:05:04,981 INFO L796 eck$LassoCheckResult]: Loop: 1640#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1659#L69-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; 1656#L69-2 assume parse_expression_list_#t~short16; 1648#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1639#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;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; 1640#L69-8 [2020-10-20 07:05:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2142843030, now seen corresponding path program 2 times [2020-10-20 07:05:04,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:04,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578509978] [2020-10-20 07:05:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:05,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:05,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:05,035 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2020-10-20 07:05:05,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:05,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681257824] [2020-10-20 07:05:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:05,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:05,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:05,043 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1461388995, now seen corresponding path program 2 times [2020-10-20 07:05:05,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:05,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504053883] [2020-10-20 07:05:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:05,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:05,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:05,082 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:05,921 WARN L193 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 139 [2020-10-20 07:05:06,071 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-20 07:05:06,072 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:05:06,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:05:06,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:05:06,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:05:06,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:05:06,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:06,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:05:06,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:05:06,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration8_Lasso [2020-10-20 07:05:06,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:05:06,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:05:06,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,445 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2020-10-20 07:05:06,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:06,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:05:07,005 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:05:07,005 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:07,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:07,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:07,031 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-20 07:05:07,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:07,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:07,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:07,054 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:05:07,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:05:07,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:05:07,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,106 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-20 07:05:07,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,159 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 07:05:07,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,163 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 07:05:07,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,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-20 07:05:07,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,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 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-20 07:05:07,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:05:07,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:05:07,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:05:07,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:05:07,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:05:07,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:05:07,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:05:07,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:05:07,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:05:07,458 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-10-20 07:05:07,459 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. 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) [2020-10-20 07:05:07,465 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:05:07,469 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:05:07,470 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:05:07,470 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2020-10-20 07:05:07,598 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2020-10-20 07:05:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:07,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:05:07,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:07,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:05:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:07,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 07:05:07,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-10-20 07:05:07,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 267 states and 360 transitions. Complement of second has 11 states. [2020-10-20 07:05:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:05:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:05:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2020-10-20 07:05:07,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2020-10-20 07:05:07,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:07,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2020-10-20 07:05:07,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:07,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2020-10-20 07:05:07,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:05:07,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2020-10-20 07:05:07,838 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2020-10-20 07:05:07,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2020-10-20 07:05:07,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:05:07,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:05:07,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2020-10-20 07:05:07,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:07,841 INFO L691 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2020-10-20 07:05:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2020-10-20 07:05:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2020-10-20 07:05:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-20 07:05:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2020-10-20 07:05:07,859 INFO L714 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2020-10-20 07:05:07,859 INFO L594 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2020-10-20 07:05:07,859 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 07:05:07,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2020-10-20 07:05:07,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 07:05:07,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:07,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:07,861 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:07,862 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:07,862 INFO L794 eck$LassoCheckResult]: Stem: 2272#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); 2250#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 2251#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2230#L62-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; 2231#L65 assume parse_expression_list_#t~switch7; 2301#L66-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; 2300#L66-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; 2299#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 2298#L66-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); 2297#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2296#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2295#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2294#L69-1 assume !parse_expression_list_#t~short17; 2293#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17; 2292#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2291#L70 assume !parse_expression_list_#t~short20; 2290#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19; 2289#L70-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~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; 2288#L41 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; 2287#L14 assume !(0 == __VERIFIER_assert_~cond); 2286#L14-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); 2285#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2284#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 2283#L62-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); 2282#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2281#L62-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; 2280#L65 assume parse_expression_list_#t~switch7; 2269#L66-5 [2020-10-20 07:05:07,863 INFO L796 eck$LassoCheckResult]: Loop: 2269#L66-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; 2279#L66-1 assume parse_expression_list_#t~short10; 2268#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;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; 2269#L66-5 [2020-10-20 07:05:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1563666499, now seen corresponding path program 1 times [2020-10-20 07:05:07,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:07,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846250275] [2020-10-20 07:05:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:05:07,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846250275] [2020-10-20 07:05:07,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:07,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:05:07,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717952970] [2020-10-20 07:05:07,947 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-10-20 07:05:07,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:07,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090917187] [2020-10-20 07:05:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:07,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:07,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:07,958 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:08,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:05:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:05:08,003 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-10-20 07:05:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:08,108 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2020-10-20 07:05:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:05:08,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 162 transitions. [2020-10-20 07:05:08,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:08,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 108 states and 147 transitions. [2020-10-20 07:05:08,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:05:08,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:05:08,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 147 transitions. [2020-10-20 07:05:08,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:08,112 INFO L691 BuchiCegarLoop]: Abstraction has 108 states and 147 transitions. [2020-10-20 07:05:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 147 transitions. [2020-10-20 07:05:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2020-10-20 07:05:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-20 07:05:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2020-10-20 07:05:08,116 INFO L714 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2020-10-20 07:05:08,116 INFO L594 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2020-10-20 07:05:08,116 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 07:05:08,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2020-10-20 07:05:08,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:08,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:08,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:08,119 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:08,119 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:08,119 INFO L794 eck$LassoCheckResult]: Stem: 2526#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); 2497#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 2498#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2481#L62-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; 2482#L65 assume !parse_expression_list_#t~switch7; 2503#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 2566#L62-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); 2565#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2564#L62-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; 2563#L65 assume parse_expression_list_#t~switch7; 2560#L66-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; 2561#L66-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; 2562#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 2488#L66-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); 2489#L67 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; 2551#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2521#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2517#L69-1 assume !parse_expression_list_#t~short17; 2518#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17; 2535#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2533#L70 assume !parse_expression_list_#t~short20; 2531#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19; 2529#L70-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~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; 2522#L41 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; 2515#L14 assume !(0 == __VERIFIER_assert_~cond); 2510#L14-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); 2490#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2491#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 2537#L62-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); 2536#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2534#L62-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; 2532#L65 assume parse_expression_list_#t~switch7; 2493#L66-5 [2020-10-20 07:05:08,120 INFO L796 eck$LassoCheckResult]: Loop: 2493#L66-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; 2494#L66-1 assume parse_expression_list_#t~short10; 2523#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;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; 2493#L66-5 [2020-10-20 07:05:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1825536073, now seen corresponding path program 1 times [2020-10-20 07:05:08,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:08,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530013439] [2020-10-20 07:05:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 07:05:08,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530013439] [2020-10-20 07:05:08,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:05:08,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 07:05:08,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26418844] [2020-10-20 07:05:08,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:08,198 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-10-20 07:05:08,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:08,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409464727] [2020-10-20 07:05:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:08,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:08,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:08,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:08,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:08,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:05:08,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:05:08,249 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand 6 states. [2020-10-20 07:05:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:08,415 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2020-10-20 07:05:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:05:08,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 193 transitions. [2020-10-20 07:05:08,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:08,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 123 states and 163 transitions. [2020-10-20 07:05:08,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:05:08,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:05:08,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 163 transitions. [2020-10-20 07:05:08,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:05:08,419 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 163 transitions. [2020-10-20 07:05:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 163 transitions. [2020-10-20 07:05:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2020-10-20 07:05:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-20 07:05:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2020-10-20 07:05:08,423 INFO L714 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2020-10-20 07:05:08,423 INFO L594 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2020-10-20 07:05:08,423 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 07:05:08,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2020-10-20 07:05:08,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:05:08,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:05:08,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:05:08,426 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:05:08,426 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:05:08,426 INFO L794 eck$LassoCheckResult]: Stem: 2776#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); 2749#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 2750#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2730#L62-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; 2731#L65 assume !parse_expression_list_#t~switch7; 2777#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 2778#L62-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); 2734#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2735#L62-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; 2817#L65 assume parse_expression_list_#t~switch7; 2816#L66-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; 2814#L66-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; 2812#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 2809#L66-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); 2808#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2807#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2770#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2771#L69-1 assume !parse_expression_list_#t~short17; 2792#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17; 2790#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2788#L70 assume !parse_expression_list_#t~short20; 2787#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19; 2780#L70-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~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; 2772#L41 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; 2765#L14 assume !(0 == __VERIFIER_assert_~cond); 2761#L14-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); 2740#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2741#L64 havoc parse_expression_list_#t~switch7;havoc parse_expression_list_#t~mem6; 2785#L62-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); 2784#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2783#L62-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; 2781#L65 assume parse_expression_list_#t~switch7; 2744#L66-5 [2020-10-20 07:05:08,426 INFO L796 eck$LassoCheckResult]: Loop: 2744#L66-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; 2745#L66-1 assume parse_expression_list_#t~short10; 2773#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;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; 2744#L66-5 [2020-10-20 07:05:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash -168608633, now seen corresponding path program 1 times [2020-10-20 07:05:08,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:08,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757940411] [2020-10-20 07:05:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 07:05:08,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757940411] [2020-10-20 07:05:08,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369119262] [2020-10-20 07:05:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:05:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:05:08,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 07:05:08,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:05:08,601 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 07:05:08,602 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:08,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:08,606 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:05:08,606 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-10-20 07:05:08,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2020-10-20 07:05:08,665 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:08,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:08,681 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 07:05:08,681 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2020-10-20 07:05:08,798 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2020-10-20 07:05:08,799 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:05:08,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:05:08,812 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:05:08,813 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2020-10-20 07:05:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 07:05:08,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:05:08,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-20 07:05:08,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215626601] [2020-10-20 07:05:08,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:05:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:05:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-10-20 07:05:08,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:05:08,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555026982] [2020-10-20 07:05:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:05:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:08,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:05:08,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:05:08,837 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:05:08,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:05:08,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 07:05:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 07:05:08,893 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. cyclomatic complexity: 40 Second operand 9 states. [2020-10-20 07:05:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:05:09,094 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2020-10-20 07:05:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:05:09,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 92 transitions. [2020-10-20 07:05:09,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:05:09,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 0 states and 0 transitions. [2020-10-20 07:05:09,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 07:05:09,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 07:05:09,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 07:05:09,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:05:09,097 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:05:09,097 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:05:09,097 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:05:09,097 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 07:05:09,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 07:05:09,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:05:09,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 07:05:09,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:05:09 BoogieIcfgContainer [2020-10-20 07:05:09,107 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:05:09,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:05:09,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:05:09,109 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:05:09,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:04:57" (3/4) ... [2020-10-20 07:05:09,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 07:05:09,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:05:09,118 INFO L168 Benchmark]: Toolchain (without parser) took 12737.20 ms. Allocated memory was 34.6 MB in the beginning and 101.2 MB in the end (delta: 66.6 MB). Free memory was 11.7 MB in the beginning and 24.5 MB in the end (delta: -12.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,118 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 33.6 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 31.4 kB). Peak memory consumption was 31.4 kB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.31 ms. Allocated memory was 34.6 MB in the beginning and 44.6 MB in the end (delta: 10.0 MB). Free memory was 10.8 MB in the beginning and 22.1 MB in the end (delta: -11.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.64 ms. Allocated memory is still 44.6 MB. Free memory was 22.0 MB in the beginning and 20.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,125 INFO L168 Benchmark]: Boogie Preprocessor took 35.00 ms. Allocated memory is still 44.6 MB. Free memory was 20.0 MB in the beginning and 18.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,126 INFO L168 Benchmark]: RCFGBuilder took 499.44 ms. Allocated memory was 44.6 MB in the beginning and 46.1 MB in the end (delta: 1.6 MB). Free memory was 18.2 MB in the beginning and 20.5 MB in the end (delta: -2.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,127 INFO L168 Benchmark]: BuchiAutomizer took 11669.97 ms. Allocated memory was 46.1 MB in the beginning and 101.2 MB in the end (delta: 55.1 MB). Free memory was 20.5 MB in the beginning and 25.8 MB in the end (delta: -5.3 MB). Peak memory consumption was 49.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,127 INFO L168 Benchmark]: Witness Printer took 7.15 ms. Allocated memory is still 101.2 MB. Free memory was 25.8 MB in the beginning and 24.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 07:05:09,134 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.18 ms. Allocated memory is still 33.6 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 31.4 kB). Peak memory consumption was 31.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 464.31 ms. Allocated memory was 34.6 MB in the beginning and 44.6 MB in the end (delta: 10.0 MB). Free memory was 10.8 MB in the beginning and 22.1 MB in the end (delta: -11.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.64 ms. Allocated memory is still 44.6 MB. Free memory was 22.0 MB in the beginning and 20.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 35.00 ms. Allocated memory is still 44.6 MB. Free memory was 20.0 MB in the beginning and 18.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 499.44 ms. Allocated memory was 44.6 MB in the beginning and 46.1 MB in the end (delta: 1.6 MB). Free memory was 18.2 MB in the beginning and 20.5 MB in the end (delta: -2.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 11669.97 ms. Allocated memory was 46.1 MB in the beginning and 101.2 MB in the end (delta: 55.1 MB). Free memory was 20.5 MB in the beginning and 25.8 MB in the end (delta: -5.3 MB). Peak memory consumption was 49.7 MB. Max. memory is 14.3 GB. * Witness Printer took 7.15 ms. Allocated memory is still 101.2 MB. Free memory was 25.8 MB in the beginning and 24.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * str + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * start and consists of 5 locations. One deterministic module has affine ranking function j and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.6s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 9.5s. Construction of modules took 0.6s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 264 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 353 SDtfs, 638 SDslu, 679 SDs, 0 SdLazy, 626 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU4 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf100 lsp91 ukn63 mio100 lsp42 div100 bol100 ite100 ukn100 eq192 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms 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...