./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 30f4e4ab 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.24-30f4e4a [2019-11-28 03:17:13,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:17:13,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:17:13,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:17:13,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:17:13,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:17:13,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:17:13,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:17:13,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:17:13,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:17:13,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:17:13,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:17:13,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:17:13,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:17:13,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:17:13,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:17:13,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:17:13,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:17:13,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:17:13,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:17:13,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:17:13,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:17:13,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:17:13,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:17:13,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:17:13,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:17:13,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:17:13,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:17:13,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:17:13,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:17:13,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:17:13,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:17:13,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:17:13,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:17:13,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:17:13,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:17:13,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:17:13,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:17:13,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:17:13,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:17:13,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:17:13,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:17:13,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:17:13,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:17:13,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:17:13,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:17:13,831 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:17:13,831 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:17:13,832 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:17:13,832 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:17:13,832 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:17:13,832 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:17:13,833 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:17:13,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:17:13,834 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:17:13,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:17:13,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:17:13,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:17:13,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:17:13,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:17:13,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:17:13,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:17:13,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:17:13,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:17:13,837 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:17:13,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:17:13,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:17:13,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:17:13,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:17:13,838 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:17:13,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:17:13,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:17:13,839 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:17:13,841 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:17:13,841 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 03:17:14,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:17:14,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:17:14,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:17:14,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:17:14,150 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:17:14,150 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 03:17:14,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b97addcc/f0ff1ab230804d2cb8530a593f477762/FLAG771a8e723 [2019-11-28 03:17:14,703 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:17:14,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 03:17:14,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b97addcc/f0ff1ab230804d2cb8530a593f477762/FLAG771a8e723 [2019-11-28 03:17:15,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b97addcc/f0ff1ab230804d2cb8530a593f477762 [2019-11-28 03:17:15,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:17:15,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:17:15,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:15,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:17:15,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:17:15,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f81f53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15, skipping insertion in model container [2019-11-28 03:17:15,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:17:15,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:17:15,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:15,319 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:17:15,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:15,454 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:17:15,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15 WrapperNode [2019-11-28 03:17:15,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:15,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:15,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:17:15,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:17:15,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:15,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:17:15,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:17:15,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:17:15,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (1/1) ... [2019-11-28 03:17:15,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:17:15,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:17:15,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:17:15,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:17:15,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (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 03:17:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:17:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:17:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:17:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-28 03:17:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:17:15,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:17:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:17:16,009 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:17:16,009 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 03:17:16,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:16 BoogieIcfgContainer [2019-11-28 03:17:16,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:17:16,011 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:17:16,011 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:17:16,015 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:17:16,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:16,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:17:15" (1/3) ... [2019-11-28 03:17:16,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52680f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:16, skipping insertion in model container [2019-11-28 03:17:16,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:16,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:15" (2/3) ... [2019-11-28 03:17:16,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52680f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:16, skipping insertion in model container [2019-11-28 03:17:16,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:16,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:16" (3/3) ... [2019-11-28 03:17:16,019 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 03:17:16,063 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:17:16,063 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:17:16,064 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:17:16,064 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:17:16,064 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:17:16,064 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:17:16,064 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:17:16,064 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:17:16,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-28 03:17:16,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:16,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:16,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:16,102 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:16,102 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:16,102 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:17:16,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-28 03:17:16,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:16,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:16,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:16,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:16,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:16,113 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 03:17:16,113 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~switch4;havoc parse_expression_list_#t~mem3; 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 03:17:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-28 03:17:16,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:16,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112872514] [2019-11-28 03:17:16,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:16,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2019-11-28 03:17:16,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:16,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963812360] [2019-11-28 03:17:16,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:16,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2019-11-28 03:17:16,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:16,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887166706] [2019-11-28 03:17:16,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:16,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:16,660 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-28 03:17:16,744 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:16,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:16,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:16,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:16,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:16,747 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:16,747 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:16,747 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:16,748 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-11-28 03:17:16,748 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:16,748 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:16,772 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 03:17:16,779 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 03:17:16,782 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 03:17:16,787 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 03:17:16,789 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 03:17:16,792 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 03:17:16,798 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 03:17:16,800 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 03:17:16,803 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 03:17:16,808 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 03:17:16,811 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 03:17:16,816 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 03:17:16,818 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 03:17:16,820 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 03:17:16,823 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 03:17:16,827 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 03:17:16,830 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 03:17:16,833 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 03:17:16,837 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 03:17:16,839 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 03:17:16,842 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 03:17:16,845 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 03:17:16,848 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 03:17:17,004 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-28 03:17:17,031 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 03:17:17,036 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 03:17:17,039 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 03:17:17,042 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 03:17:17,045 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 03:17:17,047 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 03:17:17,398 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:17,404 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 03:17:17,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,424 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,458 INFO L522 LassoAnalysis]: Proving 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 03:17:17,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,488 INFO L522 LassoAnalysis]: Proving 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 03:17:17,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,506 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 03:17:17,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:17,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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,531 INFO L522 LassoAnalysis]: Proving 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 03:17:17,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,546 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 03:17:17,551 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,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 03:17:17,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,570 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,587 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,628 INFO L522 LassoAnalysis]: Proving 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 03:17:17,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:17,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:17,685 INFO L522 LassoAnalysis]: Proving 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 03:17:17,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:17,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,769 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,789 INFO L522 LassoAnalysis]: Proving 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 03:17:17,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,811 INFO L522 LassoAnalysis]: Proving 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 03:17:17,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,831 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 03:17:17,833 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:17,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,865 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:17,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:17,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:17,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:17,900 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 03:17:17,902 INFO L522 LassoAnalysis]: Proving 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 03:17:17,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,947 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:17,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:17,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:17,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:17,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:17,974 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 03:17:17,978 INFO L522 LassoAnalysis]: Proving 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 03:17:17,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:17,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:17,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:17,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:17,988 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:17:17,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:17,989 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:17:17,989 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 03:17:17,996 INFO L522 LassoAnalysis]: Proving 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 03:17:18,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:18,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:18,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:18,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:18,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:18,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:18,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:18,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:18,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:18,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:18,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:18,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:18,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:18,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:18,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:18,038 INFO L522 LassoAnalysis]: Proving 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 03:17:18,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 03:17:18,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:18,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:18,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:18,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:18,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:18,049 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 03:17:18,053 INFO L522 LassoAnalysis]: Proving 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 03:17:18,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:18,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:18,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:18,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:18,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:18,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:18,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:18,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:18,237 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:17:18,237 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 03:17:18,258 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 03:17:18,261 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:18,262 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:18,262 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 03:17:18,290 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:17:18,302 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:17:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:18,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:18,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:18,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:18,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:18,406 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 03:17:18,424 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 03:17:18,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-11-28 03:17:18,555 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 03:17:18,558 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 03:17:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2019-11-28 03:17:18,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2019-11-28 03:17:18,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:18,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-28 03:17:18,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:18,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-28 03:17:18,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:18,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2019-11-28 03:17:18,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:18,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2019-11-28 03:17:18,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:17:18,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:17:18,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2019-11-28 03:17:18,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:18,594 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-11-28 03:17:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2019-11-28 03:17:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-28 03:17:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:17:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-28 03:17:18,629 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 03:17:18,630 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 03:17:18,630 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:17:18,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-11-28 03:17:18,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:18,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:18,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:18,634 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:18,634 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:18,634 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 03:17:18,634 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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 03:17:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2019-11-28 03:17:18,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:18,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147294383] [2019-11-28 03:17:18,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:18,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-28 03:17:18,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:18,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440908621] [2019-11-28 03:17:18,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:18,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:18,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2019-11-28 03:17:18,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:18,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935818183] [2019-11-28 03:17:18,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:18,919 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 03:17:18,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935818183] [2019-11-28 03:17:18,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:18,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:17:18,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717479626] [2019-11-28 03:17:18,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:18,975 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-11-28 03:17:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:19,094 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-28 03:17:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:17:19,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2019-11-28 03:17:19,097 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 03:17:19,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2019-11-28 03:17:19,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 03:17:19,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 03:17:19,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2019-11-28 03:17:19,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:19,099 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-11-28 03:17:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2019-11-28 03:17:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-11-28 03:17:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 03:17:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-11-28 03:17:19,104 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-28 03:17:19,104 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-28 03:17:19,104 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:17:19,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2019-11-28 03:17:19,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:19,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:19,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:19,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:19,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:19,106 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~switch4;havoc parse_expression_list_#t~mem3; 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 03:17:19,106 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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 03:17:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2019-11-28 03:17:19,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:19,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765003502] [2019-11-28 03:17:19,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:19,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-28 03:17:19,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:19,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099422788] [2019-11-28 03:17:19,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:19,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2019-11-28 03:17:19,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:19,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043376051] [2019-11-28 03:17:19,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:19,217 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:19,594 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2019-11-28 03:17:19,688 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:19,688 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:19,688 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:19,688 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:19,688 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:19,688 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,689 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:19,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:19,689 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2019-11-28 03:17:19,689 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:19,689 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:19,693 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 03:17:19,696 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 03:17:19,699 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 03:17:19,701 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 03:17:19,703 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 03:17:19,705 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 03:17:19,707 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 03:17:19,708 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 03:17:19,711 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 03:17:19,713 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 03:17:19,716 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 03:17:19,720 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 03:17:19,722 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 03:17:19,723 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 03:17:19,725 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 03:17:19,726 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 03:17:19,908 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-28 03:17:19,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,963 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 03:17:19,966 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 03:17:19,975 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 03:17:19,976 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 03:17:19,979 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 03:17:19,982 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 03:17:19,985 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 03:17:19,986 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 03:17:19,988 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 03:17:19,990 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 03:17:20,348 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:20,349 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) [2019-11-28 03:17:20,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:20,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:20,391 INFO L522 LassoAnalysis]: Proving 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 03:17:20,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,404 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 03:17:20,406 INFO L522 LassoAnalysis]: Proving 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 03:17:20,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,415 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 03:17:20,416 INFO L522 LassoAnalysis]: Proving 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 03:17:20,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,424 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 03:17:20,426 INFO L522 LassoAnalysis]: Proving 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 03:17:20,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,435 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 03:17:20,436 INFO L522 LassoAnalysis]: Proving 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 03:17:20,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,446 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 03:17:20,450 INFO L522 LassoAnalysis]: Proving 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 03:17:20,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,459 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 03:17:20,461 INFO L522 LassoAnalysis]: Proving 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 03:17:20,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:20,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,471 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 03:17:20,472 INFO L522 LassoAnalysis]: Proving 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 03:17:20,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 03:17:20,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,492 INFO L522 LassoAnalysis]: Proving 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 03:17:20,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,528 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 03:17:20,531 INFO L522 LassoAnalysis]: Proving 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 03:17:20,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:20,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,543 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 03:17:20,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:20,554 INFO L522 LassoAnalysis]: Proving 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 03:17:20,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:20,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:20,568 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 03:17:20,572 INFO L522 LassoAnalysis]: Proving 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 03:17:20,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:20,593 INFO L522 LassoAnalysis]: Proving 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 03:17:20,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:20,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,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 03:17:20,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:20,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe 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 03:17:20,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,654 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 03:17:20,657 INFO L522 LassoAnalysis]: Proving 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 03:17:20,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:20,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,667 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 03:17:20,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:20,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:20,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:20,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:20,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:20,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:20,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:20,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:20,722 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 03:17:20,722 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) [2019-11-28 03:17:20,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:20,730 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:20,730 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:20,730 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset, 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 + 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:17:20,760 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:17:20,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:17:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:20,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:20,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:20,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:20,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:20,844 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 03:17:20,844 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 03:17:20,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-28 03:17:20,952 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 03:17:20,955 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 03:17:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-11-28 03:17:20,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 03:17:20,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:20,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-28 03:17:20,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:20,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 03:17:20,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:20,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2019-11-28 03:17:20,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-11-28 03:17:20,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2019-11-28 03:17:20,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-28 03:17:20,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-28 03:17:20,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2019-11-28 03:17:20,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:20,971 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2019-11-28 03:17:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2019-11-28 03:17:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-28 03:17:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 03:17:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-11-28 03:17:20,984 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-11-28 03:17:20,984 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-11-28 03:17:20,984 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:17:20,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2019-11-28 03:17:20,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:20,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:20,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:20,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:20,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:20,988 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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 03:17:20,989 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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 03:17:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2019-11-28 03:17:20,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288828323] [2019-11-28 03:17:20,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,057 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2019-11-28 03:17:21,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069583501] [2019-11-28 03:17:21,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:21,067 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 03:17:21,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069583501] [2019-11-28 03:17:21,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:21,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:17:21,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403622603] [2019-11-28 03:17:21,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:17:21,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:21,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:17:21,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:17:21,070 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-28 03:17:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:21,085 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-28 03:17:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:17:21,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-28 03:17:21,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:21,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2019-11-28 03:17:21,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 03:17:21,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 03:17:21,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2019-11-28 03:17:21,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:21,090 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-28 03:17:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2019-11-28 03:17:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 03:17:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 03:17:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-11-28 03:17:21,100 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-28 03:17:21,100 INFO L591 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-28 03:17:21,101 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:17:21,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2019-11-28 03:17:21,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:21,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:21,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:21,103 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:21,103 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:21,104 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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 03:17:21,104 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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 03:17:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2019-11-28 03:17:21,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25213904] [2019-11-28 03:17:21,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2019-11-28 03:17:21,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185323972] [2019-11-28 03:17:21,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2019-11-28 03:17:21,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249097936] [2019-11-28 03:17:21,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:21,208 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 03:17:21,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249097936] [2019-11-28 03:17:21,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:21,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:17:21,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135184748] [2019-11-28 03:17:21,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:21,285 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-11-28 03:17:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:21,388 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2019-11-28 03:17:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:21,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 161 transitions. [2019-11-28 03:17:21,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:21,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 111 states and 148 transitions. [2019-11-28 03:17:21,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:17:21,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:17:21,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 148 transitions. [2019-11-28 03:17:21,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:21,393 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 148 transitions. [2019-11-28 03:17:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 148 transitions. [2019-11-28 03:17:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2019-11-28 03:17:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 03:17:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2019-11-28 03:17:21,398 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-11-28 03:17:21,398 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-11-28 03:17:21,398 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:17:21,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2019-11-28 03:17:21,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:21,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:21,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:21,399 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:21,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:21,400 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~switch4;havoc parse_expression_list_#t~mem3; 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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 03:17:21,400 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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 03:17:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -960269922, now seen corresponding path program 1 times [2019-11-28 03:17:21,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105050559] [2019-11-28 03:17:21,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2019-11-28 03:17:21,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980390734] [2019-11-28 03:17:21,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash -554161477, now seen corresponding path program 1 times [2019-11-28 03:17:21,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416173730] [2019-11-28 03:17:21,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:21,505 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 03:17:21,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416173730] [2019-11-28 03:17:21,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073498717] [2019-11-28 03:17:21,506 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 03:17:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:21,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:21,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:21,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:17:21,564 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 03:17:21,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:21,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 03:17:21,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754123469] [2019-11-28 03:17:21,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:17:21,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:17:21,629 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. cyclomatic complexity: 33 Second operand 7 states. [2019-11-28 03:17:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:21,771 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2019-11-28 03:17:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:21,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 222 transitions. [2019-11-28 03:17:21,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 03:17:21,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 150 states and 200 transitions. [2019-11-28 03:17:21,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 03:17:21,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 03:17:21,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2019-11-28 03:17:21,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:21,779 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2019-11-28 03:17:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2019-11-28 03:17:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2019-11-28 03:17:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 03:17:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2019-11-28 03:17:21,788 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-28 03:17:21,788 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-28 03:17:21,788 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:17:21,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 156 transitions. [2019-11-28 03:17:21,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:21,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:21,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:21,791 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:21,791 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:21,791 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~switch4;havoc parse_expression_list_#t~mem3; 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~switch4;havoc parse_expression_list_#t~mem3; 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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 03:17:21,791 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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 03:17:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 2 times [2019-11-28 03:17:21,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209337990] [2019-11-28 03:17:21,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2019-11-28 03:17:21,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812535039] [2019-11-28 03:17:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 2 times [2019-11-28 03:17:21,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:21,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71651084] [2019-11-28 03:17:21,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:21,883 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:22,494 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 118 [2019-11-28 03:17:22,614 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 03:17:22,616 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:22,616 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:22,616 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:22,616 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:22,616 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:22,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:22,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:22,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:22,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2019-11-28 03:17:22,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:22,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:22,620 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 03:17:22,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 03:17:22,624 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 03:17:22,627 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 03:17:22,629 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 03:17:22,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 03:17:22,634 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 03:17:22,638 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 03:17:22,643 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 03:17:22,644 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 03:17:22,646 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 03:17:22,649 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 03:17:22,652 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 03:17:22,654 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 03:17:22,656 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 03:17:22,658 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 03:17:22,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:22,663 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 03:17:22,960 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-28 03:17:23,003 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 03:17:23,006 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 03:17:23,010 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 03:17:23,012 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 03:17:23,014 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 03:17:23,015 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 03:17:23,018 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 03:17:23,020 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 03:17:23,414 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-11-28 03:17:23,554 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:23,554 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) [2019-11-28 03:17:23,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 03:17:23,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:23,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,579 INFO L522 LassoAnalysis]: Proving 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 03:17:23,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,589 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 03:17:23,592 INFO L522 LassoAnalysis]: Proving 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 03:17:23,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,602 INFO L522 LassoAnalysis]: Proving 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 03:17:23,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:23,615 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:23,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,625 INFO L522 LassoAnalysis]: Proving 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 03:17:23,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:23,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:17:23,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,671 INFO L522 LassoAnalysis]: Proving 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 03:17:23,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:23,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:17:23,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:23,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,689 INFO L522 LassoAnalysis]: Proving 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 03:17:23,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:23,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:23,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:23,715 INFO L522 LassoAnalysis]: Proving 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 03:17:23,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:23,732 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:23,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,750 INFO L522 LassoAnalysis]: Proving 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 03:17:23,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,758 INFO L203 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-28 03:17:23,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,762 INFO L401 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-28 03:17:23,762 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 03:17:23,771 INFO L522 LassoAnalysis]: Proving 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 03:17:23,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:23,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Exception during sending of exit command (exit): Broken pipe 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 03:17:23,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,791 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:17:23,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,800 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:17:23,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:23,812 INFO L522 LassoAnalysis]: Proving 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 03:17:23,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:23,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:23,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,832 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:17:23,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:17:23,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:23,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:23,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:23,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:23,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:23,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:23,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:23,892 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-11-28 03:17:23,892 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 03:17:23,896 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:23,900 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:23,901 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:23,901 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2019-11-28 03:17:23,948 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 03:17:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:23,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:23,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:23,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:17:23,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:24,019 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 03:17:24,019 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 03:17:24,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49 Second operand 4 states. [2019-11-28 03:17:24,161 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 03:17:24,161 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 03:17:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-11-28 03:17:24,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-28 03:17:24,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:24,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2019-11-28 03:17:24,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:24,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-28 03:17:24,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:24,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 365 transitions. [2019-11-28 03:17:24,167 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-11-28 03:17:24,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 174 states and 233 transitions. [2019-11-28 03:17:24,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:24,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:24,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 233 transitions. [2019-11-28 03:17:24,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:24,169 INFO L688 BuchiCegarLoop]: Abstraction has 174 states and 233 transitions. [2019-11-28 03:17:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 233 transitions. [2019-11-28 03:17:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2019-11-28 03:17:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 03:17:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2019-11-28 03:17:24,176 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-28 03:17:24,176 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-28 03:17:24,176 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:17:24,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 163 transitions. [2019-11-28 03:17:24,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:24,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:24,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:24,178 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 03:17:24,179 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:24,179 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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~switch4;havoc parse_expression_list_#t~mem3; 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 03:17:24,180 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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 03:17:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1008934689, now seen corresponding path program 1 times [2019-11-28 03:17:24,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:24,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374239482] [2019-11-28 03:17:24,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:24,236 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 03:17:24,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374239482] [2019-11-28 03:17:24,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:24,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:17:24,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790755353] [2019-11-28 03:17:24,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-28 03:17:24,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:24,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923866807] [2019-11-28 03:17:24,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:24,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:24,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:17:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:17:24,296 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. cyclomatic complexity: 50 Second operand 7 states. [2019-11-28 03:17:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:24,519 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2019-11-28 03:17:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:24,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 282 transitions. [2019-11-28 03:17:24,523 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2019-11-28 03:17:24,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 175 states and 230 transitions. [2019-11-28 03:17:24,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-28 03:17:24,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-28 03:17:24,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 230 transitions. [2019-11-28 03:17:24,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:24,525 INFO L688 BuchiCegarLoop]: Abstraction has 175 states and 230 transitions. [2019-11-28 03:17:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 230 transitions. [2019-11-28 03:17:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2019-11-28 03:17:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 03:17:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2019-11-28 03:17:24,530 INFO L711 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-11-28 03:17:24,530 INFO L591 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-11-28 03:17:24,530 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:17:24,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 164 transitions. [2019-11-28 03:17:24,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:24,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:24,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:24,533 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 03:17:24,533 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:24,533 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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~switch4;havoc parse_expression_list_#t~mem3; 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 03:17:24,533 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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 03:17:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2019-11-28 03:17:24,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:24,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526070308] [2019-11-28 03:17:24,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:24,579 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 03:17:24,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526070308] [2019-11-28 03:17:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:24,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:17:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920483411] [2019-11-28 03:17:24,580 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-28 03:17:24,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:24,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524102007] [2019-11-28 03:17:24,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:24,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:24,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:24,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:24,635 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. cyclomatic complexity: 48 Second operand 6 states. [2019-11-28 03:17:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:24,767 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2019-11-28 03:17:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:24,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 147 transitions. [2019-11-28 03:17:24,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:24,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 98 states and 132 transitions. [2019-11-28 03:17:24,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:17:24,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:17:24,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 132 transitions. [2019-11-28 03:17:24,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:24,771 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-28 03:17:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 132 transitions. [2019-11-28 03:17:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-28 03:17:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 03:17:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2019-11-28 03:17:24,774 INFO L711 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-28 03:17:24,774 INFO L591 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-28 03:17:24,774 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:17:24,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 132 transitions. [2019-11-28 03:17:24,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:24,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:24,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:24,777 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 03:17:24,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:24,777 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~switch4;havoc parse_expression_list_#t~mem3; 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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~switch4;havoc parse_expression_list_#t~mem3; 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 03:17:24,778 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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 03:17:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1171373033, now seen corresponding path program 1 times [2019-11-28 03:17:24,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:24,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210637573] [2019-11-28 03:17:24,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:24,848 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 03:17:24,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210637573] [2019-11-28 03:17:24,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:24,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 03:17:24,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268780317] [2019-11-28 03:17:24,850 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-28 03:17:24,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:24,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845922911] [2019-11-28 03:17:24,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:24,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:24,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:17:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:17:24,903 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. cyclomatic complexity: 41 Second operand 8 states. [2019-11-28 03:17:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:25,130 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2019-11-28 03:17:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:25,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 232 transitions. [2019-11-28 03:17:25,132 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 03:17:25,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 149 states and 201 transitions. [2019-11-28 03:17:25,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 03:17:25,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 03:17:25,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 201 transitions. [2019-11-28 03:17:25,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:25,134 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 201 transitions. [2019-11-28 03:17:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 201 transitions. [2019-11-28 03:17:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2019-11-28 03:17:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 03:17:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2019-11-28 03:17:25,140 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2019-11-28 03:17:25,143 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2019-11-28 03:17:25,143 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:17:25,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 158 transitions. [2019-11-28 03:17:25,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:25,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:25,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:25,145 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 03:17:25,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:25,145 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~switch4;havoc parse_expression_list_#t~mem3; 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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~switch4;havoc parse_expression_list_#t~mem3; 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 03:17:25,146 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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 03:17:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2019-11-28 03:17:25,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:25,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244580365] [2019-11-28 03:17:25,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:25,270 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 03:17:25,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244580365] [2019-11-28 03:17:25,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902321998] [2019-11-28 03:17:25,271 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 03:17:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:25,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:17:25,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:25,368 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 03:17:25,369 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:25,372 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:25,372 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:17:25,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-28 03:17:25,527 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 03:17:25,527 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:25,537 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:25,539 INFO L508 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 03:17:25,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2019-11-28 03:17:25,587 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 03:17:25,588 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:25,599 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:25,599 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:17:25,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2019-11-28 03:17:25,606 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 03:17:25,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:25,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-11-28 03:17:25,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298318096] [2019-11-28 03:17:25,608 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:25,608 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-28 03:17:25,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:25,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851541606] [2019-11-28 03:17:25,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:25,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:25,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:17:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:17:25,663 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. cyclomatic complexity: 48 Second operand 15 states. [2019-11-28 03:17:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:38,217 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-11-28 03:17:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 03:17:38,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 99 transitions. [2019-11-28 03:17:38,219 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:17:38,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2019-11-28 03:17:38,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:17:38,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:17:38,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:17:38,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:38,220 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:17:38,220 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:17:38,220 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:17:38,220 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:17:38,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:17:38,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:17:38,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:17:38,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:17:38 BoogieIcfgContainer [2019-11-28 03:17:38,226 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:17:38,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:17:38,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:17:38,227 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:17:38,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:16" (3/4) ... [2019-11-28 03:17:38,230 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:17:38,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:17:38,232 INFO L168 Benchmark]: Toolchain (without parser) took 23192.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -375.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:38,232 INFO L168 Benchmark]: CDTParser took 0.18 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 03:17:38,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:17:38,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:38,234 INFO L168 Benchmark]: Boogie Preprocessor took 35.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:38,234 INFO L168 Benchmark]: RCFGBuilder took 459.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:17:38,235 INFO L168 Benchmark]: BuchiAutomizer took 22214.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -229.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:38,235 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:38,237 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.18 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 415.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 459.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22214.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -229.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. 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 -1 * start + -1 * str + unknown-#length-unknown[A] 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 22.1s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 7.6s. Construction of modules took 12.9s. 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, 12.9s 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: 18ms 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...