./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.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 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:00:01,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:00:01,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:00:01,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:00:01,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:00:01,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:00:01,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:00:01,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:00:01,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:00:01,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:00:01,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:00:01,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:00:01,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:00:01,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:00:01,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:00:01,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:00:01,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:00:01,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:00:01,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:00:01,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:00:01,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:00:01,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:00:01,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:00:01,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:00:01,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:00:01,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:00:01,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:00:01,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:00:01,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:00:01,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:00:01,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:00:01,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:00:01,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:00:01,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:00:01,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:00:01,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:00:01,913 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:00:01,929 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:00:01,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:00:01,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:00:01,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:00:01,931 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:00:01,931 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:00:01,932 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:00:01,932 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:00:01,932 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:00:01,932 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:00:01,932 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:00:01,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:00:01,933 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:00:01,933 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:00:01,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:00:01,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:00:01,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:00:01,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:00:01,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:00:01,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:00:01,934 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:00:01,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:00:01,934 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:00:01,934 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:00:01,935 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:00:01,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:00:01,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:00:01,935 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:00:01,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:00:01,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:00:01,936 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:00:01,937 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:00:01,937 INFO L133 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 -> 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b [2019-01-01 23:00:01,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:00:02,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:00:02,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:00:02,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:00:02,021 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:00:02,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2019-01-01 23:00:02,079 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8759c69c1/5beb668ddfbc4deaa3a6729c47bb726c/FLAG6aa5f0ca0 [2019-01-01 23:00:02,587 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:00:02,587 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2019-01-01 23:00:02,597 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8759c69c1/5beb668ddfbc4deaa3a6729c47bb726c/FLAG6aa5f0ca0 [2019-01-01 23:00:02,894 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8759c69c1/5beb668ddfbc4deaa3a6729c47bb726c [2019-01-01 23:00:02,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:00:02,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:00:02,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:00:02,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:00:02,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:00:02,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:00:02" (1/1) ... [2019-01-01 23:00:02,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7214055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:02, skipping insertion in model container [2019-01-01 23:00:02,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:00:02" (1/1) ... [2019-01-01 23:00:02,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:00:02,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:00:03,255 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:00:03,272 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:00:03,304 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:00:03,333 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:00:03,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03 WrapperNode [2019-01-01 23:00:03,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:00:03,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:00:03,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:00:03,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:00:03,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:00:03,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:00:03,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:00:03,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:00:03,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (1/1) ... [2019-01-01 23:00:03,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:00:03,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:00:03,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:00:03,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:00:03,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (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-01-01 23:00:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:00:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 23:00:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 23:00:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-01-01 23:00:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:00:03,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:00:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 23:00:04,178 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:00:04,178 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-01 23:00:04,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:00:04 BoogieIcfgContainer [2019-01-01 23:00:04,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:00:04,179 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:00:04,179 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:00:04,184 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:00:04,185 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:00:04,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:00:02" (1/3) ... [2019-01-01 23:00:04,187 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d5cb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:00:04, skipping insertion in model container [2019-01-01 23:00:04,187 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:00:04,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:03" (2/3) ... [2019-01-01 23:00:04,188 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d5cb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:00:04, skipping insertion in model container [2019-01-01 23:00:04,188 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:00:04,188 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:00:04" (3/3) ... [2019-01-01 23:00:04,191 INFO L375 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2019-01-01 23:00:04,248 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:00:04,249 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:00:04,249 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:00:04,249 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:00:04,250 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:00:04,250 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:00:04,250 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:00:04,251 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:00:04,251 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:00:04,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-01-01 23:00:04,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-01-01 23:00:04,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:04,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:04,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:00:04,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:04,302 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:00:04,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-01-01 23:00:04,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-01-01 23:00:04,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:04,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:04,306 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 23:00:04,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:04,313 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 31#L79-3true [2019-01-01 23:00:04,313 INFO L796 eck$LassoCheckResult]: Loop: 31#L79-3true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 36#L79-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 31#L79-3true [2019-01-01 23:00:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 23:00:04,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 23:00:04,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 23:00:04,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:04,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:04,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,868 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 23:00:04,934 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:04,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:04,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:04,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:04,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:04,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:04,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:04,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:04,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 23:00:04,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:04,937 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:04,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,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-01-01 23:00:04,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,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-01-01 23:00:04,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:05,224 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:00:05,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:05,480 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:05,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:05,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:05,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:05,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:05,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:05,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:05,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:05,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:05,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:05,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:05,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:05,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:05,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:05,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,530 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 23:00:05,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:00:05,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:05,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:05,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:05,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:05,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:05,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:05,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:05,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:05,697 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 23:00:05,698 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 23:00:05,702 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:05,704 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:05,705 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:05,705 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_main_~i~1) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 2*ULTIMATE.start_main_~i~1 Supporting invariants [] [2019-01-01 23:00:05,716 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:05,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:00:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:06,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:06,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:06,079 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-01-01 23:00:06,080 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-01-01 23:00:06,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 102 states and 153 transitions. Complement of second has 8 states. [2019-01-01 23:00:06,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:00:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2019-01-01 23:00:06,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 23:00:06,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:06,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 23:00:06,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:06,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 23:00:06,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:06,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2019-01-01 23:00:06,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:06,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2019-01-01 23:00:06,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 23:00:06,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:06,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-01-01 23:00:06,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:06,334 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-01 23:00:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-01-01 23:00:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 23:00:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 23:00:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-01-01 23:00:06,360 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-01 23:00:06,361 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-01 23:00:06,361 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:00:06,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-01-01 23:00:06,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:06,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:06,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:06,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:06,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:06,364 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 194#L79-3 assume !(main_~i~1 < 8); 209#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 189#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 190#L52-4 [2019-01-01 23:00:06,365 INFO L796 eck$LassoCheckResult]: Loop: 190#L52-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; 203#L55 assume !parse_expression_list_#t~switch4; 198#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 199#L52-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); 205#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 190#L52-4 [2019-01-01 23:00:06,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,365 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-01-01 23:00:06,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:06,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:00:06,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2019-01-01 23:00:06,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:06,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,584 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 23:00:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:00:06,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:00:06,614 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 23:00:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:06,664 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-01-01 23:00:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:00:06,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-01-01 23:00:06,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:06,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-01-01 23:00:06,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:06,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:06,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-01-01 23:00:06,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:06,669 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 23:00:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-01-01 23:00:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-01 23:00:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 23:00:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-01-01 23:00:06,674 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-01 23:00:06,674 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-01 23:00:06,674 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:00:06,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-01-01 23:00:06,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:06,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:06,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:06,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:06,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:06,676 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 265#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 281#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 282#L79-3 assume !(main_~i~1 < 8); 280#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 258#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 259#L52-4 [2019-01-01 23:00:06,676 INFO L796 eck$LassoCheckResult]: Loop: 259#L52-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; 274#L55 assume !parse_expression_list_#t~switch4; 269#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 270#L52-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); 275#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 259#L52-4 [2019-01-01 23:00:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2019-01-01 23:00:06,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:06,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:06,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:06,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:06,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:06,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:06,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 23:00:06,812 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2019-01-01 23:00:06,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:00:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:00:06,910 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-01 23:00:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:06,950 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-01-01 23:00:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:00:06,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-01-01 23:00:06,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:06,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2019-01-01 23:00:06,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:06,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:06,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-01-01 23:00:06,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:06,961 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-01-01 23:00:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-01-01 23:00:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-01 23:00:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 23:00:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-01-01 23:00:06,967 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-01-01 23:00:06,967 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-01-01 23:00:06,967 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:00:06,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-01-01 23:00:06,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:06,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:06,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:06,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 23:00:06,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:06,970 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 357#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 358#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 374#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 375#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 376#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 380#L79-3 assume !(main_~i~1 < 8); 373#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 351#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 352#L52-4 [2019-01-01 23:00:06,970 INFO L796 eck$LassoCheckResult]: Loop: 352#L52-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; 367#L55 assume !parse_expression_list_#t~switch4; 362#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 363#L52-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); 368#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 352#L52-4 [2019-01-01 23:00:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,971 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2019-01-01 23:00:06,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:06,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:07,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:07,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:07,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:00:07,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:00:07,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:00:07,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:07,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:07,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 23:00:07,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:07,208 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2019-01-01 23:00:07,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:07,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:07,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:07,507 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 23:00:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:00:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:00:07,532 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-01-01 23:00:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:07,597 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-01 23:00:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:00:07,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-01-01 23:00:07,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:07,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2019-01-01 23:00:07,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:07,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:07,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-01-01 23:00:07,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:07,605 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-01 23:00:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-01-01 23:00:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-01 23:00:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 23:00:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-01-01 23:00:07,608 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-01 23:00:07,608 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-01 23:00:07,609 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:00:07,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2019-01-01 23:00:07,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:07,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:07,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:07,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-01-01 23:00:07,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:07,611 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 462#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 478#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 484#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 486#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 479#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 480#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 485#L79-3 assume !(main_~i~1 < 8); 477#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 455#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 456#L52-4 [2019-01-01 23:00:07,611 INFO L796 eck$LassoCheckResult]: Loop: 456#L52-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; 471#L55 assume !parse_expression_list_#t~switch4; 466#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 467#L52-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); 472#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 456#L52-4 [2019-01-01 23:00:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2019-01-01 23:00:07,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:07,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:07,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:07,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:07,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:07,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 23:00:07,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 23:00:07,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:00:07,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:07,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:07,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 23:00:07,831 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:07,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2019-01-01 23:00:07,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:07,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:07,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:07,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:00:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:00:07,963 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 23:00:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:07,992 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-01-01 23:00:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:00:07,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-01-01 23:00:07,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:08,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-01-01 23:00:08,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:08,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:08,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-01-01 23:00:08,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:08,001 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-01-01 23:00:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-01-01 23:00:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-01 23:00:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 23:00:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-01-01 23:00:08,008 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-01 23:00:08,008 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-01 23:00:08,008 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:00:08,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-01-01 23:00:08,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:08,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:08,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:08,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-01-01 23:00:08,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:08,010 INFO L794 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 576#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 577#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 593#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 594#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 595#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 603#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 602#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 601#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 600#L79-3 assume !(main_~i~1 < 8); 592#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 570#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 571#L52-4 [2019-01-01 23:00:08,010 INFO L796 eck$LassoCheckResult]: Loop: 571#L52-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; 586#L55 assume !parse_expression_list_#t~switch4; 581#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 582#L52-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); 587#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 571#L52-4 [2019-01-01 23:00:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2019-01-01 23:00:08,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:08,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:08,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:08,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:08,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:08,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 23:00:08,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 23:00:08,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:00:08,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:08,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:08,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 23:00:08,267 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 5 times [2019-01-01 23:00:08,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:08,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 23:00:08,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 23:00:08,387 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-01-01 23:00:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:08,429 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-01-01 23:00:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:08,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-01-01 23:00:08,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:08,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-01-01 23:00:08,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:08,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:08,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-01-01 23:00:08,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:08,435 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-01-01 23:00:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-01-01 23:00:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-01 23:00:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 23:00:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-01 23:00:08,443 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-01 23:00:08,443 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-01 23:00:08,443 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:00:08,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-01-01 23:00:08,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:08,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:08,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:08,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-01-01 23:00:08,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:08,448 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 702#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 703#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 719#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 720#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 721#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 725#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 731#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 730#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 729#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 728#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 727#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 726#L79-3 assume !(main_~i~1 < 8); 718#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 696#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 697#L52-4 [2019-01-01 23:00:08,448 INFO L796 eck$LassoCheckResult]: Loop: 697#L52-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; 712#L55 assume !parse_expression_list_#t~switch4; 707#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 708#L52-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); 713#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 697#L52-4 [2019-01-01 23:00:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2019-01-01 23:00:08,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:08,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:08,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:08,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:08,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:08,580 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 23:00:08,612 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 23:00:08,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:00:08,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:08,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:08,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 23:00:08,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 6 times [2019-01-01 23:00:08,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:08,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:08,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:08,917 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 23:00:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 23:00:08,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 23:00:08,933 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2019-01-01 23:00:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:08,984 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-01-01 23:00:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:00:08,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2019-01-01 23:00:08,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:08,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2019-01-01 23:00:08,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:08,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:08,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-01 23:00:08,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:08,988 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-01 23:00:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-01 23:00:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-01 23:00:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 23:00:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-01 23:00:08,993 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-01 23:00:08,993 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-01 23:00:08,993 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:00:08,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-01-01 23:00:08,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:08,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:08,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:08,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-01-01 23:00:08,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:08,995 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 839#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 840#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 856#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 857#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 858#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 862#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 870#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 869#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 868#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 867#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 866#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 865#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 864#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 863#L79-3 assume !(main_~i~1 < 8); 855#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 833#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 834#L52-4 [2019-01-01 23:00:08,995 INFO L796 eck$LassoCheckResult]: Loop: 834#L52-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; 849#L55 assume !parse_expression_list_#t~switch4; 844#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 845#L52-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); 850#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 834#L52-4 [2019-01-01 23:00:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2019-01-01 23:00:08,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:08,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:08,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:09,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:09,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:09,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 23:00:09,137 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 23:00:09,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:00:09,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:09,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:09,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 23:00:09,240 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 7 times [2019-01-01 23:00:09,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:09,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:09,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,387 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 23:00:09,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 23:00:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 23:00:09,403 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2019-01-01 23:00:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:09,468 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-01-01 23:00:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:00:09,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-01-01 23:00:09,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:09,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-01-01 23:00:09,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:09,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:09,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-01-01 23:00:09,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:09,473 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-01 23:00:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-01-01 23:00:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-01 23:00:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 23:00:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-01-01 23:00:09,479 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-01-01 23:00:09,479 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-01-01 23:00:09,479 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:00:09,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2019-01-01 23:00:09,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:09,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:09,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:09,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-01-01 23:00:09,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:09,484 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 987#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 988#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1004#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1005#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1006#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1010#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1020#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1019#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1018#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1017#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1016#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1015#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1014#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1013#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1012#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1011#L79-3 assume !(main_~i~1 < 8); 1003#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 983#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 984#L52-4 [2019-01-01 23:00:09,484 INFO L796 eck$LassoCheckResult]: Loop: 984#L52-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; 997#L55 assume !parse_expression_list_#t~switch4; 992#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 993#L52-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); 999#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 984#L52-4 [2019-01-01 23:00:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2019-01-01 23:00:09,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:09,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:09,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:09,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:09,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-01 23:00:09,798 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 8 times [2019-01-01 23:00:09,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:09,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 23:00:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 23:00:09,880 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-01-01 23:00:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:10,070 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-01 23:00:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:00:10,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-01 23:00:10,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:10,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-01 23:00:10,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:10,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:10,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-01 23:00:10,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:10,075 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-01 23:00:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-01 23:00:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-01 23:00:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 23:00:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-01-01 23:00:10,078 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-01 23:00:10,078 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-01 23:00:10,078 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:00:10,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2019-01-01 23:00:10,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:10,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:10,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:10,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-01-01 23:00:10,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:10,080 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1145#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1146#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1162#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1163#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1164#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1168#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1180#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1179#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1178#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1177#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1176#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1175#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1174#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1173#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1172#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1171#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1170#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1169#L79-3 assume !(main_~i~1 < 8); 1161#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1139#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1140#L52-4 [2019-01-01 23:00:10,080 INFO L796 eck$LassoCheckResult]: Loop: 1140#L52-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; 1155#L55 assume !parse_expression_list_#t~switch4; 1150#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1151#L52-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); 1156#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1140#L52-4 [2019-01-01 23:00:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2019-01-01 23:00:10,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:10,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:10,125 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 9 times [2019-01-01 23:00:10,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:10,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2019-01-01 23:00:10,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:10,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:10,397 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 23:00:15,557 WARN L181 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2019-01-01 23:00:15,844 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 23:00:15,846 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:15,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:15,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:15,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:15,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:15,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:15,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:15,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:15,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-01 23:00:15,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:15,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:15,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:15,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,056 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-01 23:00:16,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:16,506 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 23:00:16,550 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:16,551 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:16,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:16,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:16,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:16,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:16,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:16,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:16,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:16,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:16,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:16,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:16,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:16,721 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:16,732 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:00:16,732 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:00:16,732 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:16,733 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:16,733 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:16,733 INFO L520 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-01-01 23:00:16,829 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-01 23:00:16,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:00:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:16,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:16,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:16,898 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-01-01 23:00:16,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-01 23:00:16,969 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 73 states and 92 transitions. Complement of second has 4 states. [2019-01-01 23:00:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:00:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2019-01-01 23:00:16,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2019-01-01 23:00:16,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:16,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2019-01-01 23:00:16,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:16,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-01 23:00:16,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:16,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2019-01-01 23:00:16,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:16,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2019-01-01 23:00:16,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 23:00:16,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 23:00:16,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2019-01-01 23:00:16,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:16,976 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-01-01 23:00:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2019-01-01 23:00:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-01 23:00:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 23:00:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-01-01 23:00:16,983 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-01-01 23:00:16,983 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-01-01 23:00:16,984 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:00:16,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2019-01-01 23:00:16,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:16,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:16,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:16,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:16,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:16,987 INFO L794 eck$LassoCheckResult]: Stem: 1411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1388#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1389#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1413#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1414#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1415#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1433#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1432#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1431#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1430#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1429#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1428#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1427#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1426#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1425#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1424#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1423#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1422#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1421#L79-3 assume !(main_~i~1 < 8); 1412#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1380#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1381#L52-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; 1404#L55 assume parse_expression_list_#t~switch4; 1392#L56-5 [2019-01-01 23:00:16,987 INFO L796 eck$LassoCheckResult]: Loop: 1392#L56-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; 1398#L56-1 assume parse_expression_list_#t~short7; 1390#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 1392#L56-5 [2019-01-01 23:00:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:16,993 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2019-01-01 23:00:16,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:16,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:16,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2019-01-01 23:00:17,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:17,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:17,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:17,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2019-01-01 23:00:17,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:17,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:17,366 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-01-01 23:00:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:00:17,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:17,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:00:17,599 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:00:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:00:17,689 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2019-01-01 23:00:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:17,882 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-01-01 23:00:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:17,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2019-01-01 23:00:17,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 23:00:17,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2019-01-01 23:00:17,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 23:00:17,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:00:17,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2019-01-01 23:00:17,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:17,888 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-01-01 23:00:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2019-01-01 23:00:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-01-01 23:00:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 23:00:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-01-01 23:00:17,895 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-01-01 23:00:17,895 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-01-01 23:00:17,895 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 23:00:17,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2019-01-01 23:00:17,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:17,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:17,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:17,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:17,899 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:17,900 INFO L794 eck$LassoCheckResult]: Stem: 1582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1557#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1558#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1584#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1585#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1586#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1605#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1604#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1603#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1602#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1601#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1600#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1598#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1597#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1596#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1595#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1594#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1593#L79-3 assume !(main_~i~1 < 8); 1583#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1549#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1550#L52-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; 1571#L55 assume !parse_expression_list_#t~switch4; 1563#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1564#L52-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); 1574#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1572#L52-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; 1573#L55 assume parse_expression_list_#t~switch4; 1578#L56-5 [2019-01-01 23:00:17,900 INFO L796 eck$LassoCheckResult]: Loop: 1578#L56-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; 1579#L56-1 assume parse_expression_list_#t~short7; 1609#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 1578#L56-5 [2019-01-01 23:00:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2019-01-01 23:00:17,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2019-01-01 23:00:17,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2019-01-01 23:00:17,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:18,153 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:25,395 WARN L181 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 235 DAG size of output: 173 [2019-01-01 23:00:25,777 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-01-01 23:00:25,779 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:25,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:25,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:25,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:25,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:25,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:25,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:25,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:25,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-01 23:00:25,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:25,780 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:25,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,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-01-01 23:00:25,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,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-01-01 23:00:25,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,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-01-01 23:00:25,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,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-01-01 23:00:25,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:25,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-01-01 23:00:26,095 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-01 23:00:26,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:26,791 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 23:00:26,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:26,845 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:26,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:26,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:26,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:26,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:26,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:26,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:26,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:26,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:26,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:26,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:26,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:26,933 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:26,951 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 23:00:26,951 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 23:00:26,951 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:26,952 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:26,952 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:26,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2, ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset Supporting invariants [] [2019-01-01 23:00:27,119 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-01 23:00:27,133 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:00:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:27,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:27,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:27,225 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-01-01 23:00:27,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 3 states. [2019-01-01 23:00:27,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 176 states and 237 transitions. Complement of second has 7 states. [2019-01-01 23:00:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:00:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2019-01-01 23:00:27,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2019-01-01 23:00:27,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:27,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2019-01-01 23:00:27,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:27,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2019-01-01 23:00:27,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:27,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2019-01-01 23:00:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-01-01 23:00:27,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2019-01-01 23:00:27,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 23:00:27,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 23:00:27,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2019-01-01 23:00:27,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:27,349 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-01-01 23:00:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2019-01-01 23:00:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-01-01 23:00:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 23:00:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2019-01-01 23:00:27,359 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-01-01 23:00:27,359 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-01-01 23:00:27,359 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 23:00:27,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2019-01-01 23:00:27,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:27,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:27,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:27,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:27,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:27,364 INFO L794 eck$LassoCheckResult]: Stem: 1973#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1943#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1944#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1975#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1976#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1977#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1997#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1996#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1995#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1994#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1993#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1992#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1991#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1990#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1989#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1988#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1987#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1986#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1985#L79-3 assume !(main_~i~1 < 8); 1974#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 1939#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1940#L52-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; 1957#L55 assume parse_expression_list_#t~switch4; 1965#L56-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; 1966#L56-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; 2021#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2015#L56-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); 2019#L57 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#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1935#L59-8 [2019-01-01 23:00:27,367 INFO L796 eck$LassoCheckResult]: Loop: 1935#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1936#L59-1 assume !parse_expression_list_#t~short14; 1953#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 1935#L59-8 [2019-01-01 23:00:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2019-01-01 23:00:27,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:27,844 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-01-01 23:00:28,210 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2019-01-01 23:00:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:00:28,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:00:28,298 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2019-01-01 23:00:28,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:28,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:28,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:28,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:00:28,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:00:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:00:28,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:00:28,317 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-01-01 23:00:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:28,327 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-01-01 23:00:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:00:28,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2019-01-01 23:00:28,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:28,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2019-01-01 23:00:28,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 23:00:28,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:00:28,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2019-01-01 23:00:28,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:28,334 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-01-01 23:00:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2019-01-01 23:00:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-01 23:00:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 23:00:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2019-01-01 23:00:28,339 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-01-01 23:00:28,339 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-01-01 23:00:28,340 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 23:00:28,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2019-01-01 23:00:28,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:28,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:28,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:28,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:28,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:28,347 INFO L794 eck$LassoCheckResult]: Stem: 2170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2138#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2139#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2172#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2173#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2174#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2217#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2216#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2215#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2214#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2213#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2212#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2210#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2209#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2208#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2207#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2206#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2205#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2204#L79-3 assume !(main_~i~1 < 8); 2171#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 2130#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2131#L52-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; 2153#L55 assume parse_expression_list_#t~switch4; 2198#L56-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; 2147#L56-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; 2140#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2141#L56-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); 2157#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2175#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2132#L59-8 [2019-01-01 23:00:28,347 INFO L796 eck$LassoCheckResult]: Loop: 2132#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2133#L59-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; 2150#L59-2 assume parse_expression_list_#t~short13; 2177#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2169#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 2132#L59-8 [2019-01-01 23:00:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2019-01-01 23:00:28,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:28,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:28,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:28,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2019-01-01 23:00:28,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:28,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:28,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2019-01-01 23:00:28,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:28,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:28,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:28,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:00:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:00:29,168 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-01-01 23:00:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:00:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:00:29,187 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 6 states. [2019-01-01 23:00:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:29,290 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2019-01-01 23:00:29,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:29,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 182 transitions. [2019-01-01 23:00:29,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 23:00:29,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 131 states and 169 transitions. [2019-01-01 23:00:29,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:29,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:29,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2019-01-01 23:00:29,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:29,297 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 169 transitions. [2019-01-01 23:00:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2019-01-01 23:00:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2019-01-01 23:00:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 23:00:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-01-01 23:00:29,300 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-01-01 23:00:29,301 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-01-01 23:00:29,301 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 23:00:29,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 124 transitions. [2019-01-01 23:00:29,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:29,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:29,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:29,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:29,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:29,303 INFO L794 eck$LassoCheckResult]: Stem: 2416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2390#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2391#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2418#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2419#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2420#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2454#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2453#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2452#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2451#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2450#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2449#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2448#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2447#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2446#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2445#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2444#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2443#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2442#L79-3 assume !(main_~i~1 < 8); 2417#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 2386#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2387#L52-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; 2405#L55 assume !parse_expression_list_#t~switch4; 2441#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2473#L52-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); 2472#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2464#L52-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; 2461#L55 assume parse_expression_list_#t~switch4; 2458#L56-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; 2457#L56-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; 2392#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2393#L56-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); 2427#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2421#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2382#L59-8 [2019-01-01 23:00:29,303 INFO L796 eck$LassoCheckResult]: Loop: 2382#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2383#L59-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; 2402#L59-2 assume parse_expression_list_#t~short13; 2423#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2415#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 2382#L59-8 [2019-01-01 23:00:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2019-01-01 23:00:29,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:29,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:29,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:29,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:29,346 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2019-01-01 23:00:29,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:29,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:29,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:29,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2019-01-01 23:00:29,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:29,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:00:29,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:29,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:29,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:00:29,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:29,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 23:00:29,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:00:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:00:29,634 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-01-01 23:00:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:29,806 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2019-01-01 23:00:29,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:00:29,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 244 transitions. [2019-01-01 23:00:29,811 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-01 23:00:29,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 171 states and 222 transitions. [2019-01-01 23:00:29,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 23:00:29,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 23:00:29,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 222 transitions. [2019-01-01 23:00:29,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:29,815 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2019-01-01 23:00:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 222 transitions. [2019-01-01 23:00:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2019-01-01 23:00:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-01 23:00:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2019-01-01 23:00:29,820 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-01-01 23:00:29,820 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-01-01 23:00:29,820 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 23:00:29,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2019-01-01 23:00:29,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 23:00:29,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:29,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:29,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:29,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:29,826 INFO L794 eck$LassoCheckResult]: Stem: 2834#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2808#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2809#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2836#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2837#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2838#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2848#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2864#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2863#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2862#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2861#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2860#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2859#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2858#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2857#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2856#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2855#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2854#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2853#L79-3 assume !(main_~i~1 < 8); 2835#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 2800#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2801#L52-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; 2822#L55 assume !parse_expression_list_#t~switch4; 2915#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2919#L52-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); 2918#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2917#L52-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; 2914#L55 assume !parse_expression_list_#t~switch4; 2909#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2931#L52-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); 2930#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2913#L52-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; 2908#L55 assume parse_expression_list_#t~switch4; 2903#L56-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; 2898#L56-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; 2894#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2892#L56-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); 2888#L57 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; 2841#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2802#L59-8 [2019-01-01 23:00:29,826 INFO L796 eck$LassoCheckResult]: Loop: 2802#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2803#L59-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; 2819#L59-2 assume parse_expression_list_#t~short13; 2844#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2833#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 2802#L59-8 [2019-01-01 23:00:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2019-01-01 23:00:29,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:29,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2019-01-01 23:00:29,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:29,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2019-01-01 23:00:29,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:30,075 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-01-01 23:00:37,147 WARN L181 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 290 DAG size of output: 203 [2019-01-01 23:00:37,469 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-01 23:00:37,471 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:37,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:37,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:37,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:37,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:37,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:37,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:37,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:37,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration16_Lasso [2019-01-01 23:00:37,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:37,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:37,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,807 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-01-01 23:00:37,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:38,411 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 23:00:38,431 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:38,432 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:38,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:38,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:38,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:38,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,545 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 23:00:38,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,549 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:00:38,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:38,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01-01 23:00:38,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:38,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:38,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:38,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:38,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:38,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:38,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:38,612 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:00:38,613 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:00:38,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:38,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:38,617 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:38,617 INFO L520 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-01-01 23:00:38,760 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 23:00:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:38,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:38,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:38,866 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-01-01 23:00:38,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 4 states. [2019-01-01 23:00:39,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51. Second operand 4 states. Result 296 states and 391 transitions. Complement of second has 11 states. [2019-01-01 23:00:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2019-01-01 23:00:39,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2019-01-01 23:00:39,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:39,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2019-01-01 23:00:39,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:39,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2019-01-01 23:00:39,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:39,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 391 transitions. [2019-01-01 23:00:39,047 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-01-01 23:00:39,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 196 states and 256 transitions. [2019-01-01 23:00:39,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 23:00:39,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-01 23:00:39,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 256 transitions. [2019-01-01 23:00:39,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:39,052 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 256 transitions. [2019-01-01 23:00:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 256 transitions. [2019-01-01 23:00:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2019-01-01 23:00:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-01 23:00:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2019-01-01 23:00:39,062 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-01-01 23:00:39,062 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-01-01 23:00:39,062 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 23:00:39,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 184 transitions. [2019-01-01 23:00:39,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 23:00:39,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:39,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:39,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:39,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:39,069 INFO L794 eck$LassoCheckResult]: Stem: 3465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3441#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3442#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3467#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3468#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3469#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3490#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3489#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3488#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3487#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3486#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3485#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3484#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3483#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3482#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3481#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3480#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3479#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3478#L79-3 assume !(main_~i~1 < 8); 3466#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 3433#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3434#L52-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; 3453#L55 assume parse_expression_list_#t~switch4; 3526#L56-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; 3558#L56-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; 3556#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 3554#L56-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); 3553#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 3551#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3550#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3549#L59-1 assume !parse_expression_list_#t~short14; 3548#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 3547#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3546#L60 assume !parse_expression_list_#t~short17; 3545#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3544#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3543#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~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; 3542#L31 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; 3541#L4 assume !(0 == __VERIFIER_assert_~cond); 3540#L4-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); 3539#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3538#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 3537#L52-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); 3536#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3535#L52-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; 3534#L55 assume parse_expression_list_#t~switch4; 3444#L56-5 [2019-01-01 23:00:39,069 INFO L796 eck$LassoCheckResult]: Loop: 3444#L56-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; 3449#L56-1 assume parse_expression_list_#t~short7; 3443#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 3444#L56-5 [2019-01-01 23:00:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2019-01-01 23:00:39,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:39,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-01 23:00:39,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:39,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:00:39,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2019-01-01 23:00:39,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:00:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:00:39,394 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. cyclomatic complexity: 52 Second operand 7 states. [2019-01-01 23:00:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:39,570 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2019-01-01 23:00:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:39,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 159 transitions. [2019-01-01 23:00:39,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:39,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 107 states and 139 transitions. [2019-01-01 23:00:39,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 23:00:39,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 23:00:39,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 139 transitions. [2019-01-01 23:00:39,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:39,576 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-01-01 23:00:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 139 transitions. [2019-01-01 23:00:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-01 23:00:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 23:00:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-01-01 23:00:39,579 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-01-01 23:00:39,579 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-01-01 23:00:39,579 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-01 23:00:39,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2019-01-01 23:00:39,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:39,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:39,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:39,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:39,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:39,581 INFO L794 eck$LassoCheckResult]: Stem: 3750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3724#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3725#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3752#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3753#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3754#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3761#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3784#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3782#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3779#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3776#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3775#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3774#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3773#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3771#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3769#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3767#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3764#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3763#L79-3 assume !(main_~i~1 < 8); 3751#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 3716#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3717#L52-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; 3737#L55 assume !parse_expression_list_#t~switch4; 3731#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 3732#L52-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); 3740#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3738#L52-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; 3739#L55 assume parse_expression_list_#t~switch4; 3745#L56-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; 3746#L56-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; 3817#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 3818#L56-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); 3816#L57 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; 3756#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3720#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3721#L59-1 assume !parse_expression_list_#t~short14; 3736#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 3749#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3781#L60 assume !parse_expression_list_#t~short17; 3778#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3713#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3722#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~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; 3723#L31 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; 3747#L4 assume !(0 == __VERIFIER_assert_~cond); 3760#L4-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); 3743#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3744#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 3772#L52-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); 3770#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3768#L52-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; 3765#L55 assume parse_expression_list_#t~switch4; 3728#L56-5 [2019-01-01 23:00:39,581 INFO L796 eck$LassoCheckResult]: Loop: 3728#L56-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; 3733#L56-1 assume parse_expression_list_#t~short7; 3726#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 3728#L56-5 [2019-01-01 23:00:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -70433790, now seen corresponding path program 1 times [2019-01-01 23:00:39,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:39,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-01 23:00:39,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:39,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 23:00:39,822 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2019-01-01 23:00:39,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,989 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 23:00:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 23:00:40,001 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 9 states. [2019-01-01 23:00:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:40,494 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2019-01-01 23:00:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:00:40,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 240 transitions. [2019-01-01 23:00:40,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 23:00:40,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 159 states and 209 transitions. [2019-01-01 23:00:40,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 23:00:40,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:00:40,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 209 transitions. [2019-01-01 23:00:40,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:40,500 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 209 transitions. [2019-01-01 23:00:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 209 transitions. [2019-01-01 23:00:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2019-01-01 23:00:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 23:00:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2019-01-01 23:00:40,503 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 165 transitions. [2019-01-01 23:00:40,503 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 165 transitions. [2019-01-01 23:00:40,503 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-01 23:00:40,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 165 transitions. [2019-01-01 23:00:40,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:40,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:40,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:40,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:40,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:40,505 INFO L794 eck$LassoCheckResult]: Stem: 4065#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4038#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 4039#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4067#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4068#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4069#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4089#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4088#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4087#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4086#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4085#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4084#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4083#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4082#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4081#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4080#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4079#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4078#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4077#L79-3 assume !(main_~i~1 < 8); 4066#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~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); 4030#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4031#L52-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; 4051#L55 assume !parse_expression_list_#t~switch4; 4119#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 4118#L52-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); 4117#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4052#L52-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; 4053#L55 assume parse_expression_list_#t~switch4; 4060#L56-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; 4048#L56-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; 4043#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 4044#L56-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); 4057#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 4071#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4034#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 4035#L59-1 assume !parse_expression_list_#t~short14; 4050#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11; 4098#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4097#L60 assume !parse_expression_list_#t~short17; 4096#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 4026#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4036#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~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; 4037#L31 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; 4061#L4 assume !(0 == __VERIFIER_assert_~cond); 4075#L4-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); 4058#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4059#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 4094#L52-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); 4093#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4092#L52-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; 4090#L55 assume parse_expression_list_#t~switch4; 4042#L56-5 [2019-01-01 23:00:40,505 INFO L796 eck$LassoCheckResult]: Loop: 4042#L56-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; 4047#L56-1 assume parse_expression_list_#t~short7; 4040#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 4042#L56-5 [2019-01-01 23:00:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2019-01-01 23:00:40,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:40,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:40,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:40,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:41,024 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 16 [2019-01-01 23:00:41,273 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-01 23:00:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-01 23:00:41,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:41,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:00:41,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:41,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:41,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 23:00:41,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 23:00:41,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 23:00:41,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 23:00:41,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 23:00:41,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-01 23:00:41,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-01 23:00:41,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-01 23:00:41,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,663 INFO L267 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-01-01 23:00:41,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2019-01-01 23:00:41,755 INFO L478 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 30 [2019-01-01 23:00:41,762 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 23:00:41,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,768 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 23:00:41,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 23:00:41,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:41,779 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2019-01-01 23:00:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-01 23:00:41,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:41,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-01-01 23:00:41,826 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:41,827 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2019-01-01 23:00:41,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:41,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:41,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:41,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:41,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:41,944 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 23:00:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-01-01 23:00:41,958 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. cyclomatic complexity: 47 Second operand 12 states. [2019-01-01 23:00:42,130 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 23:00:42,943 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-01-01 23:00:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:43,033 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-01-01 23:00:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 23:00:43,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 112 transitions. [2019-01-01 23:00:43,034 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:00:43,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2019-01-01 23:00:43,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:00:43,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:00:43,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:00:43,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:43,035 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:43,036 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:43,036 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:43,036 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-01 23:00:43,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:00:43,036 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:00:43,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:00:43,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:00:43 BoogieIcfgContainer [2019-01-01 23:00:43,043 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:00:43,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:00:43,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:00:43,044 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:00:43,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:00:04" (3/4) ... [2019-01-01 23:00:43,048 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:00:43,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:00:43,049 INFO L168 Benchmark]: Toolchain (without parser) took 40149.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 204.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:43,050 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:00:43,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.69 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:43,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:43,052 INFO L168 Benchmark]: Boogie Preprocessor took 35.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:43,053 INFO L168 Benchmark]: RCFGBuilder took 691.26 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:43,053 INFO L168 Benchmark]: BuchiAutomizer took 38863.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.3 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:43,054 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:00:43,059 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.69 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 691.26 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38863.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.3 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 - 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 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 * unknown-#length-unknown[A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start + -1 * str and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 15 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.8s and 20 iterations. TraceHistogramMax:8. Analysis of lassos took 34.4s. Construction of modules took 1.8s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 236 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 142 states and ocurred in iteration 16. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 693 SDtfs, 913 SDslu, 1860 SDs, 0 SdLazy, 841 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU11 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital175 mio100 ax100 hnf100 lsp92 ukn56 mio100 lsp46 div100 bol100 ite100 ukn100 eq180 hnf88 smp100 dnf148 smp96 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...