./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:17:07,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:17:07,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:17:07,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:17:07,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:17:07,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:17:07,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:17:07,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:17:07,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:17:07,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:17:07,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:17:07,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:17:07,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:17:07,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:17:07,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:17:07,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:17:07,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:17:07,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:17:07,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:17:07,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:17:07,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:17:07,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:17:07,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:17:07,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:17:07,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:17:07,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:17:07,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:17:07,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:17:07,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:17:07,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:17:07,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:17:07,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:17:07,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:17:07,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:17:07,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:17:07,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:17:07,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:17:07,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:17:07,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:17:07,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:17:07,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:17:07,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:17:07,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:17:07,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:17:07,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:17:07,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:17:07,991 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:17:07,991 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:17:07,991 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:17:07,991 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:17:07,992 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:17:07,992 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:17:07,993 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:17:07,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:17:07,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:17:07,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:17:07,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:17:07,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:17:07,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:17:07,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:17:07,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:17:07,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:17:07,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:17:07,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:17:07,997 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:17:07,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:17:07,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:17:07,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:17:07,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:17:07,998 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:17:07,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:17:07,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:17:07,999 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:17:08,001 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:17:08,001 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b [2019-11-28 03:17:08,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:17:08,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:17:08,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:17:08,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:17:08,337 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:17:08,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 03:17:08,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2143601ac/2f8e5bdad4144adea90eb1e347e92a93/FLAG2a8feef8d [2019-11-28 03:17:08,926 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:17:08,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 03:17:08,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2143601ac/2f8e5bdad4144adea90eb1e347e92a93/FLAG2a8feef8d [2019-11-28 03:17:09,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2143601ac/2f8e5bdad4144adea90eb1e347e92a93 [2019-11-28 03:17:09,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:17:09,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:17:09,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:09,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:17:09,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:17:09,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff68dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09, skipping insertion in model container [2019-11-28 03:17:09,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:17:09,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:17:09,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:09,509 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:17:09,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:09,656 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:17:09,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09 WrapperNode [2019-11-28 03:17:09,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:09,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:09,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:17:09,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:17:09,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:09,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:17:09,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:17:09,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:17:09,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... [2019-11-28 03:17:09,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:17:09,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:17:09,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:17:09,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:17:09,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:17:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:17:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:17:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-28 03:17:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:17:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:17:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:17:10,256 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:17:10,256 INFO L297 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 03:17:10,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:10 BoogieIcfgContainer [2019-11-28 03:17:10,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:17:10,258 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:17:10,258 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:17:10,262 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:17:10,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:10,263 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:17:09" (1/3) ... [2019-11-28 03:17:10,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52cf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:10, skipping insertion in model container [2019-11-28 03:17:10,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:10,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:09" (2/3) ... [2019-11-28 03:17:10,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52cf74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:10, skipping insertion in model container [2019-11-28 03:17:10,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:10,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:10" (3/3) ... [2019-11-28 03:17:10,272 INFO L371 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 03:17:10,321 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:17:10,321 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:17:10,322 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:17:10,322 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:17:10,322 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:17:10,322 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:17:10,322 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:17:10,323 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:17:10,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-28 03:17:10,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-28 03:17:10,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:10,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:10,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:17:10,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:17:10,364 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:17:10,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-28 03:17:10,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-28 03:17:10,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:10,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:10,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:17:10,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:17:10,375 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:10,375 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-11-28 03:17:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:17:10,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:10,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421432995] [2019-11-28 03:17:10,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:10,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-28 03:17:10,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:10,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723111383] [2019-11-28 03:17:10,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:10,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 03:17:10,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:10,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679336997] [2019-11-28 03:17:10,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:10,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:10,758 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:10,759 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:10,759 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:10,759 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:10,759 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:10,759 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:10,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:10,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:10,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-11-28 03:17:10,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:10,760 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:10,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-11-28 03:17:10,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:10,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-11-28 03:17:10,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:10,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:10,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:11,055 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:11,061 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:11,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:11,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:11,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:11,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:11,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:11,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:11,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:11,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:11,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:11,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:11,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:11,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:11,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:11,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:11,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:11,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:11,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:11,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:11,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:11,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:11,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:11,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:11,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:11,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:11,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:11,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:11,334 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 03:17:11,335 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:11,356 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:11,360 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:11,360 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:11,361 INFO L512 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-11-28 03:17:11,372 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 03:17:11,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:17:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:11,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:11,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:11,460 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:11,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:11,516 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:11,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-11-28 03:17:11,693 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-11-28 03:17:11,693 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-11-28 03:17:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2019-11-28 03:17:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 03:17:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 03:17:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 03:17:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:11,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2019-11-28 03:17:11,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:11,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2019-11-28 03:17:11,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 03:17:11,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:11,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-11-28 03:17:11,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:11,717 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 03:17:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-11-28 03:17:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 03:17:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:17:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-28 03:17:11,746 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 03:17:11,746 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 03:17:11,746 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:17:11,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-28 03:17:11,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:11,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:11,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:11,748 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:11,748 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:11,749 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:11,749 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-11-28 03:17:11,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:11,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065946973] [2019-11-28 03:17:11,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:11,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065946973] [2019-11-28 03:17:11,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:11,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:17:11,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504699440] [2019-11-28 03:17:11,809 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:11,810 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2019-11-28 03:17:11,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:11,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700646810] [2019-11-28 03:17:11,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:11,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:11,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:17:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:17:11,956 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 03:17:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:11,977 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-28 03:17:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:17:11,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-28 03:17:11,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:11,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 03:17:11,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:11,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:11,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-28 03:17:11,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:11,989 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 03:17:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-28 03:17:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-28 03:17:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:17:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-28 03:17:11,995 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-28 03:17:11,995 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-28 03:17:11,995 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:17:11,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-11-28 03:17:11,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:11,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:12,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:12,000 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:12,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:12,003 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:12,003 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2019-11-28 03:17:12,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103486349] [2019-11-28 03:17:12,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103486349] [2019-11-28 03:17:12,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081712439] [2019-11-28 03:17:12,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:12,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:17:12,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:12,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 03:17:12,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569003306] [2019-11-28 03:17:12,164 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,164 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2019-11-28 03:17:12,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099532821] [2019-11-28 03:17:12,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:12,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:12,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:12,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:17:12,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:17:12,264 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-28 03:17:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:12,295 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-11-28 03:17:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:17:12,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-11-28 03:17:12,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:12,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2019-11-28 03:17:12,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:12,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:12,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-28 03:17:12,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:12,306 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 03:17:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-28 03:17:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-28 03:17:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 03:17:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-11-28 03:17:12,313 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-28 03:17:12,313 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-28 03:17:12,313 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:17:12,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-11-28 03:17:12,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:12,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:12,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:12,318 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 03:17:12,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:12,319 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:12,319 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2019-11-28 03:17:12,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599451855] [2019-11-28 03:17:12,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599451855] [2019-11-28 03:17:12,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840603206] [2019-11-28 03:17:12,413 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:12,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:17:12,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:17:12,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:12,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:12,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 03:17:12,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865624095] [2019-11-28 03:17:12,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2019-11-28 03:17:12,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328531084] [2019-11-28 03:17:12,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:12,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:12,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:12,559 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-28 03:17:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:12,581 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-28 03:17:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:17:12,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-11-28 03:17:12,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:12,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2019-11-28 03:17:12,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:12,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:12,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-11-28 03:17:12,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:12,584 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-11-28 03:17:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-11-28 03:17:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-28 03:17:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 03:17:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-11-28 03:17:12,589 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-28 03:17:12,589 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-28 03:17:12,589 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:17:12,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2019-11-28 03:17:12,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:12,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:12,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:12,590 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-11-28 03:17:12,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:12,591 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:12,591 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2019-11-28 03:17:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969008237] [2019-11-28 03:17:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969008237] [2019-11-28 03:17:12,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783291608] [2019-11-28 03:17:12,636 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:12,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 03:17:12,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:17:12,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:17:12,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:12,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:17:12,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073592130] [2019-11-28 03:17:12,705 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2019-11-28 03:17:12,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106065585] [2019-11-28 03:17:12,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:12,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:12,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:12,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:17:12,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:17:12,783 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 03:17:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:12,810 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-28 03:17:12,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:17:12,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-28 03:17:12,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:12,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-11-28 03:17:12,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:12,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:12,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-11-28 03:17:12,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:12,814 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-28 03:17:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-11-28 03:17:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-28 03:17:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 03:17:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-11-28 03:17:12,817 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-28 03:17:12,817 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-28 03:17:12,817 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:17:12,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-11-28 03:17:12,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:12,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:12,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:12,819 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-11-28 03:17:12,819 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:12,819 INFO L794 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:12,821 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2019-11-28 03:17:12,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:12,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870262809] [2019-11-28 03:17:12,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:12,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870262809] [2019-11-28 03:17:12,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603312318] [2019-11-28 03:17:12,918 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:13,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:17:13,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:17:13,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:13,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:13,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 03:17:13,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116435032] [2019-11-28 03:17:13,038 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 5 times [2019-11-28 03:17:13,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080260719] [2019-11-28 03:17:13,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:13,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:17:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:17:13,126 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-28 03:17:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:13,153 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-11-28 03:17:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:13,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-28 03:17:13,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:13,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-11-28 03:17:13,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:13,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:13,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-11-28 03:17:13,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:13,158 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-28 03:17:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-11-28 03:17:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-28 03:17:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 03:17:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-28 03:17:13,164 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-28 03:17:13,165 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-28 03:17:13,165 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:17:13,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-11-28 03:17:13,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:13,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:13,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:13,166 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-11-28 03:17:13,166 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:13,167 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:13,167 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2019-11-28 03:17:13,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322491281] [2019-11-28 03:17:13,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322491281] [2019-11-28 03:17:13,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526808302] [2019-11-28 03:17:13,254 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:13,317 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 03:17:13,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:17:13,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:17:13,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:13,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 03:17:13,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817986575] [2019-11-28 03:17:13,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 6 times [2019-11-28 03:17:13,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161763997] [2019-11-28 03:17:13,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:13,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 03:17:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 03:17:13,409 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2019-11-28 03:17:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:13,441 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-11-28 03:17:13,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:17:13,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2019-11-28 03:17:13,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:13,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2019-11-28 03:17:13,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:13,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:13,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-28 03:17:13,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:13,445 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-28 03:17:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-28 03:17:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-28 03:17:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 03:17:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-28 03:17:13,448 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 03:17:13,448 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 03:17:13,448 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:17:13,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-11-28 03:17:13,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:13,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:13,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:13,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-11-28 03:17:13,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:13,450 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:13,450 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2019-11-28 03:17:13,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101056550] [2019-11-28 03:17:13,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101056550] [2019-11-28 03:17:13,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406355058] [2019-11-28 03:17:13,513 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:13,582 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 03:17:13,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:17:13,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:17:13,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:13,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-28 03:17:13,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254703728] [2019-11-28 03:17:13,603 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 7 times [2019-11-28 03:17:13,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280772982] [2019-11-28 03:17:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:17:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:17:13,666 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2019-11-28 03:17:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:13,701 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-28 03:17:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:13,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-11-28 03:17:13,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:13,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-11-28 03:17:13,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:13,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:13,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-11-28 03:17:13,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:13,705 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-11-28 03:17:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-11-28 03:17:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-28 03:17:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 03:17:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-11-28 03:17:13,711 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-28 03:17:13,711 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-28 03:17:13,711 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:17:13,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2019-11-28 03:17:13,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:13,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:13,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:13,714 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-11-28 03:17:13,714 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:13,714 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:13,715 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2019-11-28 03:17:13,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133655998] [2019-11-28 03:17:13,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133655998] [2019-11-28 03:17:13,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326791329] [2019-11-28 03:17:13,827 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:13,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:17:13,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:13,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:13,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-28 03:17:13,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567076292] [2019-11-28 03:17:13,911 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 8 times [2019-11-28 03:17:13,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:13,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192663416] [2019-11-28 03:17:13,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:13,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:14,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 03:17:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 03:17:14,025 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-11-28 03:17:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:14,068 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-28 03:17:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:17:14,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-11-28 03:17:14,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:14,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-11-28 03:17:14,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:14,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:14,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-11-28 03:17:14,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:14,073 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-28 03:17:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-11-28 03:17:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 03:17:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 03:17:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-11-28 03:17:14,076 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-28 03:17:14,076 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-28 03:17:14,077 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:17:14,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2019-11-28 03:17:14,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 03:17:14,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:14,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:14,079 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-11-28 03:17:14,079 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:14,079 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:14,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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2019-11-28 03:17:14,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:14,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788890515] [2019-11-28 03:17:14,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:14,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:14,114 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 9 times [2019-11-28 03:17:14,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:14,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943056456] [2019-11-28 03:17:14,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:14,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:14,124 INFO L82 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2019-11-28 03:17:14,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:14,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810169974] [2019-11-28 03:17:14,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:14,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:18,708 WARN L192 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 194 DAG size of output: 146 [2019-11-28 03:17:18,973 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 03:17:18,975 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:18,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:18,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:18,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:18,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:18,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:18,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:18,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:18,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration10_Lasso [2019-11-28 03:17:18,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:18,976 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:18,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:18,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:18,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:18,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:18,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:19,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:19,579 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:19,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:19,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:19,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:19,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:19,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:19,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:19,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:19,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:19,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:19,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:19,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:19,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:19,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:19,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:19,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:19,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:19,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:19,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:19,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:19,939 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 03:17:19,939 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:19,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:19,945 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:19,945 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:19,945 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2019-11-28 03:17:19,973 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:17:19,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:17:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:20,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:20,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:20,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:20,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:20,029 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:17:20,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-28 03:17:20,082 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-11-28 03:17:20,083 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-11-28 03:17:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2019-11-28 03:17:20,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-28 03:17:20,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:20,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2019-11-28 03:17:20,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:20,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-28 03:17:20,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:20,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2019-11-28 03:17:20,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:20,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2019-11-28 03:17:20,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:17:20,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:17:20,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2019-11-28 03:17:20,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:20,090 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-11-28 03:17:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2019-11-28 03:17:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-28 03:17:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 03:17:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-11-28 03:17:20,104 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-28 03:17:20,104 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-28 03:17:20,104 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:17:20,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2019-11-28 03:17:20,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:20,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:20,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:20,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:20,107 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:20,108 INFO L794 eck$LassoCheckResult]: Stem: 1411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:17:20,108 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1392#L56-5 [2019-11-28 03:17:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2019-11-28 03:17:20,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987145783] [2019-11-28 03:17:20,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2019-11-28 03:17:20,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209337990] [2019-11-28 03:17:20,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2019-11-28 03:17:20,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812535039] [2019-11-28 03:17:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:20,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812535039] [2019-11-28 03:17:20,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:20,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:17:20,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343505382] [2019-11-28 03:17:20,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:17:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:17:20,493 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2019-11-28 03:17:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:20,687 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-11-28 03:17:20,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:20,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2019-11-28 03:17:20,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 03:17:20,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2019-11-28 03:17:20,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:17:20,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:17:20,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2019-11-28 03:17:20,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:20,690 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-11-28 03:17:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2019-11-28 03:17:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-11-28 03:17:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 03:17:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-11-28 03:17:20,695 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-28 03:17:20,695 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-28 03:17:20,695 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:17:20,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2019-11-28 03:17:20,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:20,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:20,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:20,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:20,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:20,698 INFO L794 eck$LassoCheckResult]: Stem: 1582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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~mem3;havoc parse_expression_list_#t~switch4; 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-11-28 03:17:20,698 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1578#L56-5 [2019-11-28 03:17:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2019-11-28 03:17:20,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529365302] [2019-11-28 03:17:20,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2019-11-28 03:17:20,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443169965] [2019-11-28 03:17:20,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2019-11-28 03:17:20,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:20,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454842002] [2019-11-28 03:17:20,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:20,793 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:27,540 WARN L192 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 236 DAG size of output: 170 [2019-11-28 03:17:27,885 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-28 03:17:27,887 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:27,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:27,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:27,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:27,887 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:27,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:27,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:27,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:27,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2019-11-28 03:17:27,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:27,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:27,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:27,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,128 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-28 03:17:28,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,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-11-28 03:17:28,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,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-11-28 03:17:28,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:28,584 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:28,584 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:28,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:28,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:28,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:28,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:28,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:28,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:28,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:28,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:28,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:28,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:28,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:28,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:28,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:28,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:28,921 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-28 03:17:28,921 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:28,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:28,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:28,928 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:28,928 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_3, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~start~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_3 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~start~0 Supporting invariants [] [2019-11-28 03:17:28,952 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 03:17:28,955 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:17:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:28,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:28,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:29,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:29,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:29,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:17:29,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-11-28 03:17:29,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 176 states and 237 transitions. Complement of second has 8 states. [2019-11-28 03:17:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-28 03:17:29,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 03:17:29,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:29,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2019-11-28 03:17:29,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:29,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2019-11-28 03:17:29,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:29,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2019-11-28 03:17:29,159 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-11-28 03:17:29,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2019-11-28 03:17:29,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 03:17:29,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-28 03:17:29,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2019-11-28 03:17:29,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:29,163 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-11-28 03:17:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2019-11-28 03:17:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-11-28 03:17:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 03:17:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2019-11-28 03:17:29,168 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-11-28 03:17:29,168 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-11-28 03:17:29,168 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:17:29,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2019-11-28 03:17:29,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:29,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:29,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:29,170 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:29,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:29,171 INFO L794 eck$LassoCheckResult]: Stem: 1981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1950#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; 1951#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; 1983#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1984#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; 1985#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2006#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; 2005#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2004#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; 2003#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2002#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; 2001#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2000#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; 1999#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1998#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; 1997#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1996#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; 1995#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1994#L79-3 assume !(main_~i~1 < 8); 1982#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); 1946#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1947#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; 1964#L55 assume parse_expression_list_#t~switch4; 1973#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; 1974#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; 2028#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2024#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); 2027#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; 1988#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1942#L59-8 [2019-11-28 03:17:29,171 INFO L796 eck$LassoCheckResult]: Loop: 1942#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1943#L59-1 assume !parse_expression_list_#t~short14; 1960#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;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; 1942#L59-8 [2019-11-28 03:17:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2019-11-28 03:17:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863125815] [2019-11-28 03:17:29,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:29,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863125815] [2019-11-28 03:17:29,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:29,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 03:17:29,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613350593] [2019-11-28 03:17:29,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2019-11-28 03:17:29,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688473654] [2019-11-28 03:17:29,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:29,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688473654] [2019-11-28 03:17:29,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:29,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:17:29,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755621245] [2019-11-28 03:17:29,524 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:17:29,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:17:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:17:29,525 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-11-28 03:17:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:29,538 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-11-28 03:17:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:17:29,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2019-11-28 03:17:29,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:29,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2019-11-28 03:17:29,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:17:29,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:17:29,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2019-11-28 03:17:29,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:29,543 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-28 03:17:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2019-11-28 03:17:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-28 03:17:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 03:17:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2019-11-28 03:17:29,547 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-28 03:17:29,547 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-28 03:17:29,547 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 03:17:29,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2019-11-28 03:17:29,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:29,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:29,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:29,549 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:29,549 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:29,549 INFO L794 eck$LassoCheckResult]: Stem: 2178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2146#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; 2147#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; 2180#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2181#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; 2182#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2225#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; 2224#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2223#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; 2222#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2221#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; 2220#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2218#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; 2217#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2216#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; 2215#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2214#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; 2213#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2212#L79-3 assume !(main_~i~1 < 8); 2179#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); 2138#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2139#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; 2161#L55 assume parse_expression_list_#t~switch4; 2206#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; 2155#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; 2148#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2149#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); 2165#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2183#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2140#L59-8 [2019-11-28 03:17:29,549 INFO L796 eck$LassoCheckResult]: Loop: 2140#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2141#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; 2158#L59-2 assume parse_expression_list_#t~short13; 2185#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2177#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;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; 2140#L59-8 [2019-11-28 03:17:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2019-11-28 03:17:29,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268780317] [2019-11-28 03:17:29,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,577 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2019-11-28 03:17:29,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228148074] [2019-11-28 03:17:29,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2019-11-28 03:17:29,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455782439] [2019-11-28 03:17:29,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:29,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455782439] [2019-11-28 03:17:29,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:29,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:17:29,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316551255] [2019-11-28 03:17:29,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:29,696 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 6 states. [2019-11-28 03:17:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:29,812 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2019-11-28 03:17:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:29,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 182 transitions. [2019-11-28 03:17:29,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:29,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 131 states and 169 transitions. [2019-11-28 03:17:29,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:29,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:17:29,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2019-11-28 03:17:29,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:29,820 INFO L688 BuchiCegarLoop]: Abstraction has 131 states and 169 transitions. [2019-11-28 03:17:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2019-11-28 03:17:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2019-11-28 03:17:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 03:17:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-11-28 03:17:29,824 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-28 03:17:29,824 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-28 03:17:29,824 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 03:17:29,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 124 transitions. [2019-11-28 03:17:29,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:29,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:29,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:29,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:29,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:29,827 INFO L794 eck$LassoCheckResult]: Stem: 2424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2398#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; 2399#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; 2426#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2427#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; 2428#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2462#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; 2461#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2460#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; 2459#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2458#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; 2457#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2456#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; 2455#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); 2425#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); 2394#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2395#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; 2413#L55 assume !parse_expression_list_#t~switch4; 2449#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2481#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); 2480#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2473#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; 2470#L55 assume parse_expression_list_#t~switch4; 2466#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; 2465#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; 2400#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2401#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); 2435#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2429#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2390#L59-8 [2019-11-28 03:17:29,827 INFO L796 eck$LassoCheckResult]: Loop: 2390#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2391#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; 2410#L59-2 assume parse_expression_list_#t~short13; 2431#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2423#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;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; 2390#L59-8 [2019-11-28 03:17:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2019-11-28 03:17:29,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093016968] [2019-11-28 03:17:29,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,862 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2019-11-28 03:17:29,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963424680] [2019-11-28 03:17:29,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:29,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2019-11-28 03:17:29,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:29,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593415287] [2019-11-28 03:17:29,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:29,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593415287] [2019-11-28 03:17:29,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85930257] [2019-11-28 03:17:29,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:29,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:17:29,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:29,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:17:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:29,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:29,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 03:17:29,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448854769] [2019-11-28 03:17:30,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:17:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:17:30,061 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-11-28 03:17:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:30,207 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2019-11-28 03:17:30,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:30,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 244 transitions. [2019-11-28 03:17:30,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 03:17:30,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 171 states and 222 transitions. [2019-11-28 03:17:30,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 03:17:30,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 03:17:30,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 222 transitions. [2019-11-28 03:17:30,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:30,212 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2019-11-28 03:17:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 222 transitions. [2019-11-28 03:17:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2019-11-28 03:17:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 03:17:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2019-11-28 03:17:30,216 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-11-28 03:17:30,216 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-11-28 03:17:30,216 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 03:17:30,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2019-11-28 03:17:30,217 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:30,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:30,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:30,218 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:30,219 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:30,219 INFO L794 eck$LassoCheckResult]: Stem: 2842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2816#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; 2817#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; 2844#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2845#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; 2846#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2856#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; 2872#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2871#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; 2870#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2869#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; 2868#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2867#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; 2866#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2865#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); 2843#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); 2808#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2809#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; 2830#L55 assume !parse_expression_list_#t~switch4; 2923#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2927#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); 2926#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2925#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; 2922#L55 assume !parse_expression_list_#t~switch4; 2917#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2939#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); 2938#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2921#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; 2916#L55 assume parse_expression_list_#t~switch4; 2912#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; 2906#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; 2902#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2900#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); 2896#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; 2849#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2810#L59-8 [2019-11-28 03:17:30,219 INFO L796 eck$LassoCheckResult]: Loop: 2810#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2811#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; 2827#L59-2 assume parse_expression_list_#t~short13; 2852#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2841#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;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; 2810#L59-8 [2019-11-28 03:17:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:30,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2019-11-28 03:17:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:30,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84905393] [2019-11-28 03:17:30,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:30,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2019-11-28 03:17:30,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:30,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70372351] [2019-11-28 03:17:30,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:30,260 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:30,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2019-11-28 03:17:30,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:30,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479214884] [2019-11-28 03:17:30,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:30,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:38,662 WARN L192 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 291 DAG size of output: 200 [2019-11-28 03:17:38,999 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-28 03:17:39,001 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:39,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:39,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:39,001 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:39,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:39,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:39,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:39,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration16_Lasso [2019-11-28 03:17:39,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:39,002 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:39,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,306 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-28 03:17:39,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:39,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:39,715 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:39,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:39,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:39,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:39,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:39,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:39,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,954 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:17:39,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,956 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:17:39,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:39,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:17:39,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:39,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:39,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:39,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:39,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:17:39,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:17:39,990 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:40,010 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 03:17:40,010 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:40,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:40,021 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:17:40,021 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:40,021 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2019-11-28 03:17:40,048 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:17:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:40,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:40,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:40,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:17:40,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:40,145 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:17:40,145 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 4 states. [2019-11-28 03:17:40,267 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-11-28 03:17:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 03:17:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2019-11-28 03:17:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2019-11-28 03:17:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2019-11-28 03:17:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2019-11-28 03:17:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:40,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 391 transitions. [2019-11-28 03:17:40,276 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-11-28 03:17:40,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 196 states and 256 transitions. [2019-11-28 03:17:40,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-28 03:17:40,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-28 03:17:40,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 256 transitions. [2019-11-28 03:17:40,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:40,278 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 256 transitions. [2019-11-28 03:17:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 256 transitions. [2019-11-28 03:17:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2019-11-28 03:17:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-28 03:17:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2019-11-28 03:17:40,285 INFO L711 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-11-28 03:17:40,285 INFO L591 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-11-28 03:17:40,285 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-28 03:17:40,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 184 transitions. [2019-11-28 03:17:40,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:40,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:40,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:40,287 INFO L849 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-11-28 03:17:40,287 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:40,288 INFO L794 eck$LassoCheckResult]: Stem: 3473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3449#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; 3450#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; 3475#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3476#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; 3477#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3498#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; 3497#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3496#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; 3495#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3494#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; 3493#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3492#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; 3491#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); 3474#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); 3441#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3442#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; 3461#L55 assume parse_expression_list_#t~switch4; 3534#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; 3568#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; 3570#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 3569#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); 3560#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; 3559#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3558#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3557#L59-1 assume !parse_expression_list_#t~short14; 3556#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11; 3555#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3554#L60 assume !parse_expression_list_#t~short17; 3553#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3552#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3551#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; 3550#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; 3549#L4 assume !(0 == __VERIFIER_assert_~cond); 3548#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); 3547#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3546#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3545#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); 3544#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3543#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; 3542#L55 assume parse_expression_list_#t~switch4; 3452#L56-5 [2019-11-28 03:17:40,288 INFO L796 eck$LassoCheckResult]: Loop: 3452#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; 3457#L56-1 assume parse_expression_list_#t~short7; 3451#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 3452#L56-5 [2019-11-28 03:17:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -207736402, now seen corresponding path program 1 times [2019-11-28 03:17:40,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:40,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121643782] [2019-11-28 03:17:40,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:40,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121643782] [2019-11-28 03:17:40,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:40,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 03:17:40,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965353387] [2019-11-28 03:17:40,374 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2019-11-28 03:17:40,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:40,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124494581] [2019-11-28 03:17:40,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:40,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:40,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:17:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:17:40,449 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. cyclomatic complexity: 52 Second operand 8 states. [2019-11-28 03:17:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:40,789 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2019-11-28 03:17:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:17:40,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 304 transitions. [2019-11-28 03:17:40,792 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2019-11-28 03:17:40,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 196 states and 252 transitions. [2019-11-28 03:17:40,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-28 03:17:40,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-28 03:17:40,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 252 transitions. [2019-11-28 03:17:40,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:40,794 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 252 transitions. [2019-11-28 03:17:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 252 transitions. [2019-11-28 03:17:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 167. [2019-11-28 03:17:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-28 03:17:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2019-11-28 03:17:40,800 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 214 transitions. [2019-11-28 03:17:40,800 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 214 transitions. [2019-11-28 03:17:40,800 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-28 03:17:40,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 214 transitions. [2019-11-28 03:17:40,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-28 03:17:40,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:40,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:40,806 INFO L849 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-11-28 03:17:40,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:40,807 INFO L794 eck$LassoCheckResult]: Stem: 3877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3848#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; 3849#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; 3879#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3880#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; 3881#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3906#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; 3905#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3904#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; 3903#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3902#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; 3901#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3900#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; 3899#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3898#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; 3897#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3896#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; 3895#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3894#L79-3 assume !(main_~i~1 < 8); 3878#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); 3840#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3841#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; 3863#L55 assume parse_expression_list_#t~switch4; 3935#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; 3934#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; 3933#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 3932#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); 3931#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 3930#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3929#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3928#L59-1 assume !parse_expression_list_#t~short14; 3927#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11; 3926#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3925#L60 assume !parse_expression_list_#t~short17; 3924#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3923#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3922#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; 3921#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; 3920#L4 assume !(0 == __VERIFIER_assert_~cond); 3919#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); 3918#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3917#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3916#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); 3915#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3914#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; 3912#L55 assume parse_expression_list_#t~switch4; 3851#L56-5 [2019-11-28 03:17:40,807 INFO L796 eck$LassoCheckResult]: Loop: 3851#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; 3857#L56-1 assume parse_expression_list_#t~short7; 3850#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 3851#L56-5 [2019-11-28 03:17:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2019-11-28 03:17:40,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:40,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739518532] [2019-11-28 03:17:40,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 03:17:40,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739518532] [2019-11-28 03:17:40,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:40,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:17:40,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565150450] [2019-11-28 03:17:40,914 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2019-11-28 03:17:40,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:40,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474382553] [2019-11-28 03:17:40,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:40,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:40,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:17:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:17:40,972 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. cyclomatic complexity: 57 Second operand 7 states. [2019-11-28 03:17:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:41,153 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2019-11-28 03:17:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:41,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2019-11-28 03:17:41,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:41,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 107 states and 139 transitions. [2019-11-28 03:17:41,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:17:41,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:17:41,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 139 transitions. [2019-11-28 03:17:41,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:41,157 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-28 03:17:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 139 transitions. [2019-11-28 03:17:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 03:17:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 03:17:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-11-28 03:17:41,159 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-28 03:17:41,160 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-28 03:17:41,160 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-28 03:17:41,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2019-11-28 03:17:41,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:17:41,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:41,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:41,161 INFO L849 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-11-28 03:17:41,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:17:41,162 INFO L794 eck$LassoCheckResult]: Stem: 4180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4152#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; 4153#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; 4182#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4183#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; 4184#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4218#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; 4214#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4212#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; 4209#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4206#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; 4205#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4204#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; 4203#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4201#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; 4199#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4197#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; 4194#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4193#L79-3 assume !(main_~i~1 < 8); 4181#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); 4148#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4149#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; 4166#L55 assume !parse_expression_list_#t~switch4; 4160#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 4161#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); 4175#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4167#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; 4168#L55 assume parse_expression_list_#t~switch4; 4159#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; 4176#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; 4246#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 4245#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); 4192#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 4189#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4146#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 4147#L59-1 assume !parse_expression_list_#t~short14; 4165#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11; 4179#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4211#L60 assume !parse_expression_list_#t~short17; 4208#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 4141#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4150#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; 4151#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; 4177#L4 assume !(0 == __VERIFIER_assert_~cond); 4190#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); 4173#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4174#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 4202#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); 4200#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4198#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; 4195#L55 assume parse_expression_list_#t~switch4; 4156#L56-5 [2019-11-28 03:17:41,162 INFO L796 eck$LassoCheckResult]: Loop: 4156#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; 4162#L56-1 assume parse_expression_list_#t~short7; 4154#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 4156#L56-5 [2019-11-28 03:17:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2019-11-28 03:17:41,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:41,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334082473] [2019-11-28 03:17:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 03:17:41,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334082473] [2019-11-28 03:17:41,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222809018] [2019-11-28 03:17:41,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:17:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:41,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:17:41,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:41,367 INFO L377 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-11-28 03:17:41,368 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,382 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:41,382 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 03:17:41,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:41,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 03:17:41,396 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,398 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:41,398 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-28 03:17:41,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-28 03:17:41,436 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,443 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:41,445 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 03:17:41,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2019-11-28 03:17:41,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2019-11-28 03:17:41,493 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,498 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:17:41,498 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:17:41,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2019-11-28 03:17:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-28 03:17:41,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:17:41,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 03:17:41,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630403322] [2019-11-28 03:17:41,512 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:17:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:41,512 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2019-11-28 03:17:41,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:41,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457811365] [2019-11-28 03:17:41,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:41,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:41,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:17:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:17:41,570 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 10 states. [2019-11-28 03:17:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:41,802 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-11-28 03:17:41,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:41,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 102 transitions. [2019-11-28 03:17:41,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:17:41,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2019-11-28 03:17:41,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:17:41,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:17:41,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:17:41,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:41,803 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:17:41,803 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:17:41,804 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:17:41,804 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-28 03:17:41,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:17:41,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:17:41,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:17:41,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:17:41 BoogieIcfgContainer [2019-11-28 03:17:41,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:17:41,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:17:41,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:17:41,811 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:17:41,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:10" (3/4) ... [2019-11-28 03:17:41,815 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:17:41,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:17:41,816 INFO L168 Benchmark]: Toolchain (without parser) took 32581.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 961.7 MB in the beginning and 828.9 MB in the end (delta: 132.8 MB). Peak memory consumption was 469.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:17:41,817 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:41,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:17:41,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:41,818 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:41,818 INFO L168 Benchmark]: RCFGBuilder took 499.66 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:17:41,818 INFO L168 Benchmark]: BuchiAutomizer took 31552.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 828.9 MB in the end (delta: 254.1 MB). Peak memory consumption was 463.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:17:41,819 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.4 GB. Free memory is still 828.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:17:41,820 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 420.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 499.66 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31552.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 828.9 MB in the end (delta: 254.1 MB). Peak memory consumption was 463.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.4 GB. Free memory is still 828.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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[A] + -1 * str + -1 * start and consists of 5 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 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.4s and 20 iterations. TraceHistogramMax:8. Analysis of lassos took 28.8s. Construction of modules took 1.0s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 232 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 167 states and ocurred in iteration 17. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 695 SDtfs, 932 SDslu, 1917 SDs, 0 SdLazy, 859 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU11 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax100 hnf100 lsp92 ukn55 mio100 lsp49 div100 bol100 ite100 ukn100 eq181 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...