./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/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 5f5357e64289d6bac41f74df7b40a85eebbaa806 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:49:42,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:49:42,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:49:42,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:49:42,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:49:42,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:49:42,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:49:42,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:49:42,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:49:42,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:49:42,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:49:42,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:49:42,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:49:42,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:49:42,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:49:42,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:49:42,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:49:42,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:49:42,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:49:42,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:49:42,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:49:42,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:49:42,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:49:42,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:49:42,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:49:42,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:49:42,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:49:42,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:49:42,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:49:42,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:49:42,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:49:42,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:49:42,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:49:42,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:49:42,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:49:42,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:49:42,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:49:42,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:49:42,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:49:42,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:49:42,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:49:42,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:49:42,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:49:42,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:49:42,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:49:42,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:49:42,844 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:49:42,845 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:49:42,845 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:49:42,845 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:49:42,845 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:49:42,846 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:49:42,846 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:49:42,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:49:42,847 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:49:42,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:49:42,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:49:42,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:49:42,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:49:42,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:49:42,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:49:42,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:49:42,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:49:42,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:49:42,849 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:49:42,849 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:49:42,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:49:42,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:49:42,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:49:42,851 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:49:42,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:49:42,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:49:42,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:49:42,852 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:49:42,853 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:49:42,853 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 -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2019-11-28 20:49:43,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:49:43,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:49:43,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:49:43,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:49:43,223 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:49:43,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 20:49:43,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e11686f2/08a8f84ccd744a0fa0a46ef729472724/FLAGff3ccbd97 [2019-11-28 20:49:43,862 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:49:43,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 20:49:43,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e11686f2/08a8f84ccd744a0fa0a46ef729472724/FLAGff3ccbd97 [2019-11-28 20:49:44,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e11686f2/08a8f84ccd744a0fa0a46ef729472724 [2019-11-28 20:49:44,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:49:44,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:49:44,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:49:44,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:49:44,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:49:44,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76344466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44, skipping insertion in model container [2019-11-28 20:49:44,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:49:44,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:49:44,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:49:44,510 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:49:44,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:49:44,642 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:49:44,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44 WrapperNode [2019-11-28 20:49:44,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:49:44,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:49:44,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:49:44,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:49:44,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:49:44,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:49:44,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:49:44,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:49:44,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (1/1) ... [2019-11-28 20:49:44,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:49:44,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:49:44,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:49:44,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:49:44,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (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 [2019-11-28 20:49:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:49:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:49:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:49:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-28 20:49:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:49:44,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:49:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:49:45,231 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:49:45,232 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 20:49:45,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:49:45 BoogieIcfgContainer [2019-11-28 20:49:45,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:49:45,234 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:49:45,234 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:49:45,238 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:49:45,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:49:45,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:49:44" (1/3) ... [2019-11-28 20:49:45,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71ad7722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:49:45, skipping insertion in model container [2019-11-28 20:49:45,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:49:45,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:44" (2/3) ... [2019-11-28 20:49:45,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71ad7722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:49:45, skipping insertion in model container [2019-11-28 20:49:45,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:49:45,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:49:45" (3/3) ... [2019-11-28 20:49:45,244 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 20:49:45,289 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:49:45,289 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:49:45,289 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:49:45,290 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:49:45,290 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:49:45,290 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:49:45,290 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:49:45,290 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:49:45,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-28 20:49:45,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 20:49:45,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:45,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:45,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:45,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:45,331 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:49:45,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-28 20:49:45,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 20:49:45,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:45,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:45,335 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:45,335 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:45,341 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 25#L50true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L51-4true [2019-11-28 20:49:45,341 INFO L796 eck$LassoCheckResult]: Loop: 3#L51-4true parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 11#L54true assume !parse_expression_list_#t~switch4; 29#L53true havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 8#L51-1true call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L51-2true assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3#L51-4true [2019-11-28 20:49:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-28 20:49:45,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:45,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620674597] [2019-11-28 20:49:45,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:45,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2019-11-28 20:49:45,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:45,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677347280] [2019-11-28 20:49:45,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:45,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2019-11-28 20:49:45,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:45,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132966422] [2019-11-28 20:49:45,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:45,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:45,929 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-28 20:49:46,023 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:46,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:46,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:46,025 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:46,025 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:46,026 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:46,026 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:46,026 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:46,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-11-28 20:49:46,027 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:46,027 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,336 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-28 20:49:46,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:46,858 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:49:46,864 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) [2019-11-28 20:49:46,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:46,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:46,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:46,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:46,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:46,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:46,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:46,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:46,904 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 [2019-11-28 20:49:46,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:46,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:46,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:46,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:46,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:46,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:46,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:46,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:46,924 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) [2019-11-28 20:49:46,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:46,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:46,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:46,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:46,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:46,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:46,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:46,968 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) [2019-11-28 20:49:46,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,007 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) [2019-11-28 20:49:47,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,033 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) [2019-11-28 20:49:47,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 [2019-11-28 20:49:47,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-11-28 20:49:47,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,100 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 [2019-11-28 20:49:47,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,118 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 [2019-11-28 20:49:47,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:47,151 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 [2019-11-28 20:49:47,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,180 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) [2019-11-28 20:49:47,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 [2019-11-28 20:49:47,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,207 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 [2019-11-28 20:49:47,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,240 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) [2019-11-28 20:49:47,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,260 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 [2019-11-28 20:49:47,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:47,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,292 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 [2019-11-28 20:49:47,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,318 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 [2019-11-28 20:49:47,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:47,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,440 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 [2019-11-28 20:49:47,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:47,456 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) [2019-11-28 20:49:47,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:47,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,471 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) [2019-11-28 20:49:47,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 [2019-11-28 20:49:47,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:47,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:47,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:47,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:47,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:47,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,549 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:49:47,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,551 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:49:47,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,557 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) [2019-11-28 20:49:47,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:47,583 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 [2019-11-28 20:49:47,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:47,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:47,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,620 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) [2019-11-28 20:49:47,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:47,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:47,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:47,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:47,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:47,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:47,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:47,796 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:49:47,796 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. 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) [2019-11-28 20:49:47,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:47,837 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:47,837 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:47,838 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2019-11-28 20:49:47,863 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 20:49:47,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:49:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:47,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:47,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:47,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:49:47,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:47,981 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:49:47,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-11-28 20:49:48,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 99 states and 138 transitions. Complement of second has 5 states. [2019-11-28 20:49:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:49:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2019-11-28 20:49:48,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2019-11-28 20:49:48,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:48,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-28 20:49:48,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:48,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-28 20:49:48,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:48,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2019-11-28 20:49:48,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:48,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2019-11-28 20:49:48,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:49:48,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:49:48,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2019-11-28 20:49:48,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:48,148 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-11-28 20:49:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2019-11-28 20:49:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-28 20:49:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:49:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-28 20:49:48,181 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 20:49:48,181 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 20:49:48,182 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:49:48,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-11-28 20:49:48,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:48,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:48,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:48,186 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:48,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:48,186 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 221#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 222#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 204#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 205#L54 assume parse_expression_list_#t~switch4; 214#L55-5 [2019-11-28 20:49:48,187 INFO L796 eck$LassoCheckResult]: Loop: 214#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 215#L55-1 assume parse_expression_list_#t~short7; 219#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 214#L55-5 [2019-11-28 20:49:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2019-11-28 20:49:48,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:48,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113171438] [2019-11-28 20:49:48,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:48,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-28 20:49:48,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:48,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617441060] [2019-11-28 20:49:48,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,275 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2019-11-28 20:49:48,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:48,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25884394] [2019-11-28 20:49:48,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:48,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25884394] [2019-11-28 20:49:48,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:48,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:49:48,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880954159] [2019-11-28 20:49:48,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:49:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:49:48,562 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-11-28 20:49:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:48,718 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-28 20:49:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:49:48,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2019-11-28 20:49:48,721 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 20:49:48,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2019-11-28 20:49:48,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 20:49:48,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 20:49:48,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2019-11-28 20:49:48,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:48,723 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-11-28 20:49:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2019-11-28 20:49:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-11-28 20:49:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:49:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-11-28 20:49:48,728 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-28 20:49:48,728 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-28 20:49:48,728 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:49:48,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2019-11-28 20:49:48,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:48,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:48,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:48,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:48,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:48,731 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 345#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 346#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 327#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 328#L54 assume !parse_expression_list_#t~switch4; 337#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 342#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 331#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 329#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 330#L54 assume parse_expression_list_#t~switch4; 338#L55-5 [2019-11-28 20:49:48,731 INFO L796 eck$LassoCheckResult]: Loop: 338#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 339#L55-1 assume parse_expression_list_#t~short7; 372#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 338#L55-5 [2019-11-28 20:49:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2019-11-28 20:49:48,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:48,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074790307] [2019-11-28 20:49:48,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-28 20:49:48,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:48,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949813395] [2019-11-28 20:49:48,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2019-11-28 20:49:48,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:48,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441998649] [2019-11-28 20:49:48,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:48,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:49,197 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2019-11-28 20:49:49,294 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:49,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:49,294 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:49,294 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:49,295 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:49,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:49,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:49,295 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:49,295 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2019-11-28 20:49:49,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:49,295 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:49,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,567 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-28 20:49:49,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:49,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:50,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:49:50,006 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 20:49:50,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:50,020 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) [2019-11-28 20:49:50,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,036 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) [2019-11-28 20:49:50,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,078 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) [2019-11-28 20:49:50,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,090 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) [2019-11-28 20:49:50,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:50,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,185 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,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 [2019-11-28 20:49:50,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:50,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:50,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:50,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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:50,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:50,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:50,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:50,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:50,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:50,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:50,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:50,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:50,375 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 20:49:50,376 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:50,381 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:49:50,386 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:50,386 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:50,386 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, ULTIMATE.start_parse_expression_list_~str.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset Supporting invariants [] [2019-11-28 20:49:50,412 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 20:49:50,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:49:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:50,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:49:50,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:50,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:49:50,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:50,494 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 [2019-11-28 20:49:50,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-28 20:49:50,605 INFO L76 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. [2019-11-28 20:49:50,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:49:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-11-28 20:49:50,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 20:49:50,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:50,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-28 20:49:50,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:50,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:49:50,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:50,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2019-11-28 20:49:50,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-11-28 20:49:50,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2019-11-28 20:49:50,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-28 20:49:50,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-28 20:49:50,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2019-11-28 20:49:50,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:50,616 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2019-11-28 20:49:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2019-11-28 20:49:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-28 20:49:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 20:49:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-11-28 20:49:50,624 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-11-28 20:49:50,624 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-11-28 20:49:50,624 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:49:50,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2019-11-28 20:49:50,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:50,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:50,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:50,626 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:50,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:50,627 INFO L794 eck$LassoCheckResult]: Stem: 677#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 653#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 654#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 632#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 633#L54 assume parse_expression_list_#t~switch4; 661#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 678#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 650#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 638#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 639#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 662#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 663#L58-8 [2019-11-28 20:49:50,627 INFO L796 eck$LassoCheckResult]: Loop: 663#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 670#L58-1 assume !parse_expression_list_#t~short14; 656#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 663#L58-8 [2019-11-28 20:49:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2019-11-28 20:49:50,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:50,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486812480] [2019-11-28 20:49:50,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:50,658 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2019-11-28 20:49:50,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:50,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299242157] [2019-11-28 20:49:50,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:50,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299242157] [2019-11-28 20:49:50,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:50,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:49:50,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416089545] [2019-11-28 20:49:50,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:49:50,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:49:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:49:50,686 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-28 20:49:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:50,704 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-28 20:49:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:49:50,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-28 20:49:50,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:50,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2019-11-28 20:49:50,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 20:49:50,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 20:49:50,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2019-11-28 20:49:50,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:50,710 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-28 20:49:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2019-11-28 20:49:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 20:49:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 20:49:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-11-28 20:49:50,724 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-28 20:49:50,724 INFO L591 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-28 20:49:50,724 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:49:50,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2019-11-28 20:49:50,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:50,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:50,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:50,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:50,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:50,727 INFO L794 eck$LassoCheckResult]: Stem: 827#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 804#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 805#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 784#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 785#L54 assume parse_expression_list_#t~switch4; 796#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 797#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 835#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 832#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 816#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 807#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 808#L58-8 [2019-11-28 20:49:50,727 INFO L796 eck$LassoCheckResult]: Loop: 808#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 820#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 817#L58-2 assume parse_expression_list_#t~short13; 811#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 812#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 808#L58-8 [2019-11-28 20:49:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2019-11-28 20:49:50,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:50,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094807486] [2019-11-28 20:49:50,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:50,785 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2019-11-28 20:49:50,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:50,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217736903] [2019-11-28 20:49:50,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:50,795 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2019-11-28 20:49:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:50,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755408159] [2019-11-28 20:49:50,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:50,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755408159] [2019-11-28 20:49:50,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:50,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:49:50,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143974045] [2019-11-28 20:49:50,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:49:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:49:50,940 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-11-28 20:49:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:51,073 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2019-11-28 20:49:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:49:51,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 161 transitions. [2019-11-28 20:49:51,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 20:49:51,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 111 states and 148 transitions. [2019-11-28 20:49:51,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 20:49:51,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 20:49:51,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 148 transitions. [2019-11-28 20:49:51,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:51,083 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 148 transitions. [2019-11-28 20:49:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 148 transitions. [2019-11-28 20:49:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2019-11-28 20:49:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 20:49:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2019-11-28 20:49:51,092 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-11-28 20:49:51,092 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-11-28 20:49:51,092 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:49:51,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2019-11-28 20:49:51,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:51,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:51,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:51,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:51,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:51,097 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1017#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1018#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 997#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 998#L54 assume !parse_expression_list_#t~switch4; 1020#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1073#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1072#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1066#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1019#L54 assume parse_expression_list_#t~switch4; 1021#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1011#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1071#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 1002#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1003#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1023#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1024#L58-8 [2019-11-28 20:49:51,097 INFO L796 eck$LassoCheckResult]: Loop: 1024#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1036#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1033#L58-2 assume parse_expression_list_#t~short13; 1027#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1028#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1024#L58-8 [2019-11-28 20:49:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash -960269922, now seen corresponding path program 1 times [2019-11-28 20:49:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:51,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186353342] [2019-11-28 20:49:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2019-11-28 20:49:51,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:51,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626692253] [2019-11-28 20:49:51,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash -554161477, now seen corresponding path program 1 times [2019-11-28 20:49:51,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:51,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719859122] [2019-11-28 20:49:51,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:51,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719859122] [2019-11-28 20:49:51,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726337689] [2019-11-28 20:49:51,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:49:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:51,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:49:51,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:51,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:49:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:51,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:51,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 20:49:51,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161031352] [2019-11-28 20:49:51,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:51,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:49:51,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:49:51,347 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. cyclomatic complexity: 33 Second operand 7 states. [2019-11-28 20:49:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:51,487 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2019-11-28 20:49:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:49:51,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 222 transitions. [2019-11-28 20:49:51,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 20:49:51,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 150 states and 200 transitions. [2019-11-28 20:49:51,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 20:49:51,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 20:49:51,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2019-11-28 20:49:51,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:51,493 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2019-11-28 20:49:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2019-11-28 20:49:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2019-11-28 20:49:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 20:49:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2019-11-28 20:49:51,500 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-28 20:49:51,500 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-28 20:49:51,500 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:49:51,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 156 transitions. [2019-11-28 20:49:51,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 20:49:51,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:51,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:51,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:49:51,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:49:51,503 INFO L794 eck$LassoCheckResult]: Stem: 1365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1342#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1343#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1321#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1322#L54 assume !parse_expression_list_#t~switch4; 1420#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1419#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1418#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1417#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1416#L54 assume !parse_expression_list_#t~switch4; 1380#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1429#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1384#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1383#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1379#L54 assume parse_expression_list_#t~switch4; 1332#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1333#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1366#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 1325#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1326#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1345#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1346#L58-8 [2019-11-28 20:49:51,503 INFO L796 eck$LassoCheckResult]: Loop: 1346#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1358#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1355#L58-2 assume parse_expression_list_#t~short13; 1349#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1350#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1346#L58-8 [2019-11-28 20:49:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 2 times [2019-11-28 20:49:51,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:51,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473201319] [2019-11-28 20:49:51,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2019-11-28 20:49:51,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:51,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284272607] [2019-11-28 20:49:51,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 2 times [2019-11-28 20:49:51,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:51,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647572813] [2019-11-28 20:49:51,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:51,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:52,244 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 118 [2019-11-28 20:49:52,355 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:49:52,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:49:52,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:49:52,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:49:52,356 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:49:52,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:52,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:49:52,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:49:52,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2019-11-28 20:49:52,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:49:52,357 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:49:52,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,743 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-28 20:49:52,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:52,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:49:53,240 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-11-28 20:49:53,407 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:49:53,407 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:49:53,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:49:53,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:49:53,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,650 INFO L203 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-28 20:49:53,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,654 INFO L401 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-28 20:49:53,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,683 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 20:49:53,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,685 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 20:49:53,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:49:53,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:49:53,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:49:53,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:49:53,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:49:53,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:49:53,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:49:53,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:49:53,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:49:53,780 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-11-28 20:49:53,781 INFO L444 ModelExtractionUtils]: 10 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:53,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:49:53,787 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:49:53,788 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:49:53,788 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 [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:49:53,844 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 20:49:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:53,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:49:53,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:53,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:49:53,888 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:53,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:49:53,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49 Second operand 4 states. [2019-11-28 20:49:54,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 271 states and 365 transitions. Complement of second has 11 states. [2019-11-28 20:49:54,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 20:49:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:49:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-11-28 20:49:54,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-28 20:49:54,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:54,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2019-11-28 20:49:54,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:54,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-28 20:49:54,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:49:54,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 365 transitions. [2019-11-28 20:49:54,044 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-11-28 20:49:54,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 174 states and 233 transitions. [2019-11-28 20:49:54,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 20:49:54,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 20:49:54,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 233 transitions. [2019-11-28 20:49:54,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:54,046 INFO L688 BuchiCegarLoop]: Abstraction has 174 states and 233 transitions. [2019-11-28 20:49:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 233 transitions. [2019-11-28 20:49:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2019-11-28 20:49:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:49:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2019-11-28 20:49:54,052 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-28 20:49:54,052 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-28 20:49:54,052 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:49:54,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 163 transitions. [2019-11-28 20:49:54,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 20:49:54,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:54,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:54,054 INFO L849 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] [2019-11-28 20:49:54,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:54,055 INFO L794 eck$LassoCheckResult]: Stem: 1926#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1902#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1903#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1882#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1883#L54 assume parse_expression_list_#t~switch4; 1984#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1989#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1987#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 1985#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1982#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1980#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1978#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1976#L58-1 assume !parse_expression_list_#t~short14; 1974#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13; 1971#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1970#L59 assume !parse_expression_list_#t~short17; 1968#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 1966#L59-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~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 1964#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1961#L3 assume !(0 == __VERIFIER_assert_~cond); 1960#L3-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); 1957#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 1953#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1950#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1947#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1946#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1945#L54 assume parse_expression_list_#t~switch4; 1899#L55-5 [2019-11-28 20:49:54,055 INFO L796 eck$LassoCheckResult]: Loop: 1899#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1942#L55-1 assume parse_expression_list_#t~short7; 1898#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1899#L55-5 [2019-11-28 20:49:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1008934689, now seen corresponding path program 1 times [2019-11-28 20:49:54,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:54,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004011682] [2019-11-28 20:49:54,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:54,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004011682] [2019-11-28 20:49:54,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:54,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:49:54,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577664947] [2019-11-28 20:49:54,125 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:54,125 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-28 20:49:54,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:54,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185302451] [2019-11-28 20:49:54,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:54,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:54,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:49:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:49:54,179 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. cyclomatic complexity: 50 Second operand 7 states. [2019-11-28 20:49:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:54,433 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2019-11-28 20:49:54,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:49:54,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 282 transitions. [2019-11-28 20:49:54,437 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2019-11-28 20:49:54,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 175 states and 230 transitions. [2019-11-28 20:49:54,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-28 20:49:54,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-28 20:49:54,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 230 transitions. [2019-11-28 20:49:54,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:54,439 INFO L688 BuchiCegarLoop]: Abstraction has 175 states and 230 transitions. [2019-11-28 20:49:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 230 transitions. [2019-11-28 20:49:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2019-11-28 20:49:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 20:49:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2019-11-28 20:49:54,459 INFO L711 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-11-28 20:49:54,459 INFO L591 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-11-28 20:49:54,459 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:49:54,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 164 transitions. [2019-11-28 20:49:54,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 20:49:54,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:54,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:54,462 INFO L849 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] [2019-11-28 20:49:54,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:54,464 INFO L794 eck$LassoCheckResult]: Stem: 2282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2254#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2255#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2235#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2236#L54 assume parse_expression_list_#t~switch4; 2317#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2316#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2315#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2314#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2313#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2312#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2311#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2310#L58-1 assume !parse_expression_list_#t~short14; 2309#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13; 2308#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2296#L59 assume !parse_expression_list_#t~short17; 2297#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2307#L59-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~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2305#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2303#L3 assume !(0 == __VERIFIER_assert_~cond); 2301#L3-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); 2244#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2245#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2306#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2304#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2302#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2300#L54 assume parse_expression_list_#t~switch4; 2246#L55-5 [2019-11-28 20:49:54,464 INFO L796 eck$LassoCheckResult]: Loop: 2246#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2247#L55-1 assume parse_expression_list_#t~short7; 2252#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2246#L55-5 [2019-11-28 20:49:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2019-11-28 20:49:54,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:54,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76225918] [2019-11-28 20:49:54,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:54,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76225918] [2019-11-28 20:49:54,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:54,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:49:54,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235435389] [2019-11-28 20:49:54,534 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-28 20:49:54,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:54,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177578216] [2019-11-28 20:49:54,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:54,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:54,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:49:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:49:54,600 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. cyclomatic complexity: 48 Second operand 6 states. [2019-11-28 20:49:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:54,739 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2019-11-28 20:49:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:49:54,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 147 transitions. [2019-11-28 20:49:54,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:54,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 98 states and 132 transitions. [2019-11-28 20:49:54,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 20:49:54,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:49:54,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 132 transitions. [2019-11-28 20:49:54,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:54,744 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-28 20:49:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 132 transitions. [2019-11-28 20:49:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-28 20:49:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:49:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2019-11-28 20:49:54,747 INFO L711 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-28 20:49:54,747 INFO L591 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-28 20:49:54,747 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:49:54,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 132 transitions. [2019-11-28 20:49:54,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:54,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:54,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:54,749 INFO L849 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] [2019-11-28 20:49:54,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:54,749 INFO L794 eck$LassoCheckResult]: Stem: 2528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2504#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2505#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2485#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2486#L54 assume !parse_expression_list_#t~switch4; 2506#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2569#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2567#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2564#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2562#L54 assume parse_expression_list_#t~switch4; 2499#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2500#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2580#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2581#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2582#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 2509#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2510#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2520#L58-1 assume !parse_expression_list_#t~short14; 2521#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13; 2534#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2533#L59 assume !parse_expression_list_#t~short17; 2531#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2529#L59-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~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2525#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2518#L3 assume !(0 == __VERIFIER_assert_~cond); 2515#L3-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); 2494#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2495#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2579#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2578#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2576#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2574#L54 assume parse_expression_list_#t~switch4; 2497#L55-5 [2019-11-28 20:49:54,749 INFO L796 eck$LassoCheckResult]: Loop: 2497#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2498#L55-1 assume parse_expression_list_#t~short7; 2502#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2497#L55-5 [2019-11-28 20:49:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1171373033, now seen corresponding path program 1 times [2019-11-28 20:49:54,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:54,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782899878] [2019-11-28 20:49:54,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:49:54,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782899878] [2019-11-28 20:49:54,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:54,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:49:54,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326289635] [2019-11-28 20:49:54,817 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-28 20:49:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:54,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458294555] [2019-11-28 20:49:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:54,823 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:54,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:49:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:49:54,877 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. cyclomatic complexity: 41 Second operand 8 states. [2019-11-28 20:49:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:55,100 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2019-11-28 20:49:55,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:49:55,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 232 transitions. [2019-11-28 20:49:55,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 20:49:55,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 149 states and 201 transitions. [2019-11-28 20:49:55,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 20:49:55,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 20:49:55,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 201 transitions. [2019-11-28 20:49:55,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:49:55,104 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 201 transitions. [2019-11-28 20:49:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 201 transitions. [2019-11-28 20:49:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2019-11-28 20:49:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 20:49:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2019-11-28 20:49:55,107 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2019-11-28 20:49:55,107 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2019-11-28 20:49:55,107 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:49:55,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 158 transitions. [2019-11-28 20:49:55,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 20:49:55,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:55,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:55,109 INFO L849 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] [2019-11-28 20:49:55,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:55,109 INFO L794 eck$LassoCheckResult]: Stem: 2823#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2796#L-1 havoc main_#res;havoc main_#t~ret20, 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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2797#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2776#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2777#L54 assume !parse_expression_list_#t~switch4; 2798#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2788#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2789#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2778#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2779#L54 assume parse_expression_list_#t~switch4; 2867#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2889#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2887#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2885#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2808#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2801#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2802#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2819#L58-1 assume !parse_expression_list_#t~short14; 2838#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13; 2836#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2834#L59 assume !parse_expression_list_#t~short17; 2833#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2826#L59-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~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2820#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2812#L3 assume !(0 == __VERIFIER_assert_~cond); 2807#L3-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); 2786#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2787#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2831#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2830#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2829#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2827#L54 assume parse_expression_list_#t~switch4; 2790#L55-5 [2019-11-28 20:49:55,110 INFO L796 eck$LassoCheckResult]: Loop: 2790#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2791#L55-1 assume parse_expression_list_#t~short7; 2794#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2790#L55-5 [2019-11-28 20:49:55,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2019-11-28 20:49:55,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:55,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301410767] [2019-11-28 20:49:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:49:55,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301410767] [2019-11-28 20:49:55,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170104660] [2019-11-28 20:49:55,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:49:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:55,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 20:49:55,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:55,299 INFO L377 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 [2019-11-28 20:49:55,299 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:55,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:55,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:49:55,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-28 20:49:55,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-28 20:49:55,503 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:55,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:55,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 20:49:55,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2019-11-28 20:49:55,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2019-11-28 20:49:55,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:55,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:55,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:49:55,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2019-11-28 20:49:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:49:55,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:55,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-11-28 20:49:55,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208395632] [2019-11-28 20:49:55,591 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-28 20:49:55,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:55,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822722992] [2019-11-28 20:49:55,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:55,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:55,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:49:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:49:55,656 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. cyclomatic complexity: 48 Second operand 15 states. [2019-11-28 20:50:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:03,764 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-11-28 20:50:03,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:50:03,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 99 transitions. [2019-11-28 20:50:03,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:03,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2019-11-28 20:50:03,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:50:03,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:50:03,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:50:03,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:03,767 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:03,767 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:03,767 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:03,767 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:50:03,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:50:03,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:03,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:50:03,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:50:03 BoogieIcfgContainer [2019-11-28 20:50:03,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:50:03,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:50:03,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:50:03,776 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:50:03,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:49:45" (3/4) ... [2019-11-28 20:50:03,781 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:50:03,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:50:03,782 INFO L168 Benchmark]: Toolchain (without parser) took 19547.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 961.7 MB in the beginning and 852.7 MB in the end (delta: 109.0 MB). Peak memory consumption was 414.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:03,782 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:03,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:03,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:03,783 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:03,784 INFO L168 Benchmark]: RCFGBuilder took 485.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:03,784 INFO L168 Benchmark]: BuchiAutomizer took 18541.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 852.7 MB in the end (delta: 219.9 MB). Peak memory consumption was 409.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:03,785 INFO L168 Benchmark]: Witness Printer took 4.68 ms. Allocated memory is still 1.3 GB. Free memory is still 852.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:03,787 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 485.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18541.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 852.7 MB in the end (delta: 219.9 MB). Peak memory consumption was 409.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.68 ms. Allocated memory is still 1.3 GB. Free memory is still 852.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * start + -1 * str 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 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.4s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 8.3s. Construction of modules took 8.5s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 272 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 124 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 344 SDtfs, 845 SDslu, 819 SDs, 0 SdLazy, 857 SolverSat, 138 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital159 mio100 ax100 hnf101 lsp90 ukn74 mio100 lsp43 div100 bol100 ite100 ukn100 eq183 hnf86 smp96 dnf205 smp74 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 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...