./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a65335ed794a80f1ca394ca36923b36cd04a5678d21ae98cca1d59ae759f86b2 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:26:16,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:26:16,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:26:16,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:26:16,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:26:16,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:26:16,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:26:16,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:26:16,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:26:16,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:26:16,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:26:16,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:26:16,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:26:16,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:26:16,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:26:16,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:26:16,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:26:16,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:26:16,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:26:16,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:26:16,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:26:16,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:26:16,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:26:16,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:26:16,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:26:16,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:26:16,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:26:16,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:26:16,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:26:16,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:26:16,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:26:16,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:26:16,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:26:16,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:26:16,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:26:16,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:26:16,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:26:16,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:26:16,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:26:16,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:26:16,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:26:16,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:26:16,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:26:16,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:26:16,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:26:16,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:26:16,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:26:16,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:26:16,805 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:26:16,805 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:26:16,805 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:26:16,806 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:26:16,806 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:26:16,806 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:26:16,807 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:26:16,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:26:16,807 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:26:16,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:26:16,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:26:16,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:26:16,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:26:16,808 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:26:16,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:26:16,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:26:16,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:26:16,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:26:16,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:26:16,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:26:16,810 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:26:16,810 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> a65335ed794a80f1ca394ca36923b36cd04a5678d21ae98cca1d59ae759f86b2 [2021-12-14 23:26:16,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:26:17,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:26:17,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:26:17,017 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:26:17,017 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:26:17,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-12-14 23:26:17,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdcb9232/0d6f4bc0b8074b37a60100e488799782/FLAG02b96035c [2021-12-14 23:26:17,447 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:26:17,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-12-14 23:26:17,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdcb9232/0d6f4bc0b8074b37a60100e488799782/FLAG02b96035c [2021-12-14 23:26:17,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdcb9232/0d6f4bc0b8074b37a60100e488799782 [2021-12-14 23:26:17,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:26:17,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:26:17,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:26:17,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:26:17,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:26:17,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7741118e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17, skipping insertion in model container [2021-12-14 23:26:17,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:26:17,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:26:17,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[840,853] [2021-12-14 23:26:17,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:26:17,678 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:26:17,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[840,853] [2021-12-14 23:26:17,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:26:17,723 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:26:17,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17 WrapperNode [2021-12-14 23:26:17,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:26:17,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:26:17,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:26:17,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:26:17,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,765 INFO L137 Inliner]: procedures = 41, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2021-12-14 23:26:17,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:26:17,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:26:17,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:26:17,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:26:17,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:26:17,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:26:17,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:26:17,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:26:17,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (1/1) ... [2021-12-14 23:26:17,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:17,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:17,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:17,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:26:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:26:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:26:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:26:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:26:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:26:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-12-14 23:26:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:26:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:26:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:26:17,963 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:26:17,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:26:18,145 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:26:18,149 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:26:18,151 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 23:26:18,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:26:18 BoogieIcfgContainer [2021-12-14 23:26:18,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:26:18,153 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:26:18,153 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:26:18,156 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:26:18,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:26:18,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:26:17" (1/3) ... [2021-12-14 23:26:18,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@508af23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:26:18, skipping insertion in model container [2021-12-14 23:26:18,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:26:18,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:26:17" (2/3) ... [2021-12-14 23:26:18,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@508af23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:26:18, skipping insertion in model container [2021-12-14 23:26:18,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:26:18,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:26:18" (3/3) ... [2021-12-14 23:26:18,159 INFO L388 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-12-14 23:26:18,197 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:26:18,197 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:26:18,197 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:26:18,198 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:26:18,198 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:26:18,198 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:26:18,198 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:26:18,198 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:26:18,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:18,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:18,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:18,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:18,231 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-14 23:26:18,231 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:18,231 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:26:18,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:18,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-14 23:26:18,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:18,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:18,236 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-14 23:26:18,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:18,241 INFO L791 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 6#L61true assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 11#L62-4true [2021-12-14 23:26:18,242 INFO L793 eck$LassoCheckResult]: Loop: 11#L62-4true parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 34#L65true assume !parse_expression_list_#t~switch5#1; 20#L64true havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 16#L62-1true call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 31#L62-2true assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 11#L62-4true [2021-12-14 23:26:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-12-14 23:26:18,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:18,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271753245] [2021-12-14 23:26:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:18,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:18,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:18,387 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2021-12-14 23:26:18,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:18,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400404881] [2021-12-14 23:26:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:18,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:18,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:18,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2021-12-14 23:26:18,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:18,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980629610] [2021-12-14 23:26:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:18,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:18,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:18,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:19,002 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:19,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:19,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:19,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:19,003 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:19,003 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:19,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:19,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2021-12-14 23:26:19,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:19,004 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:19,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:19,582 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:19,585 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:19,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:26:19,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:26:19,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:26:19,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:26:19,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:26:19,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:26:19,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:26:19,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:19,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:19,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:19,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:19,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:19,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:19,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:19,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:26:19,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:19,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:19,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:19,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:19,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:19,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:19,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:19,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:19,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:26:20,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:20,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:20,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:20,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-14 23:26:20,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:26:20,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:20,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:20,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:20,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,102 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:26:20,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:20,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:20,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:26:20,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:20,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:20,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-14 23:26:20,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,213 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-14 23:26:20,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:20,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,220 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-14 23:26:20,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,221 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-14 23:26:20,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:20,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,243 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-14 23:26:20,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:20,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:20,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,284 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-14 23:26:20,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:20,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:20,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:20,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-14 23:26:20,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-14 23:26:20,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:20,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:20,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:20,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:20,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:20,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:20,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:20,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:20,370 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-14 23:26:20,370 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-14 23:26:20,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:20,372 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:20,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-14 23:26:20,374 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:20,420 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:26:20,420 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:20,420 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1, ULTIMATE.start_parse_expression_list_~i~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [] [2021-12-14 23:26:20,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,485 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2021-12-14 23:26:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:20,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:26:20,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:20,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:26:20,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:20,631 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 [2021-12-14 23:26:20,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:20,697 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 99 states and 138 transitions. Complement of second has 5 states. [2021-12-14 23:26:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-14 23:26:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2021-12-14 23:26:20,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2021-12-14 23:26:20,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:20,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2021-12-14 23:26:20,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:20,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2021-12-14 23:26:20,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:20,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2021-12-14 23:26:20,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:20,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2021-12-14 23:26:20,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-14 23:26:20,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-14 23:26:20,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2021-12-14 23:26:20,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:20,721 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2021-12-14 23:26:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2021-12-14 23:26:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-12-14 23:26:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2021-12-14 23:26:20,737 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2021-12-14 23:26:20,737 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2021-12-14 23:26:20,738 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:26:20,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2021-12-14 23:26:20,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:20,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:20,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:20,739 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:20,739 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:20,739 INFO L791 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 246#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 247#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 259#L65 assume parse_expression_list_#t~switch5#1; 256#L66-5 [2021-12-14 23:26:20,739 INFO L793 eck$LassoCheckResult]: Loop: 256#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 268#L66-1 assume parse_expression_list_#t~short8#1; 255#L66-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 256#L66-5 [2021-12-14 23:26:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2021-12-14 23:26:20,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408960257] [2021-12-14 23:26:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,759 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2021-12-14 23:26:20,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144289122] [2021-12-14 23:26:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:20,796 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2021-12-14 23:26:20,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:20,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116028888] [2021-12-14 23:26:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:20,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:20,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:20,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:20,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116028888] [2021-12-14 23:26:20,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116028888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:20,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:20,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 23:26:20,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980390222] [2021-12-14 23:26:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:20,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 23:26:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 23:26:20,946 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:21,034 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2021-12-14 23:26:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:26:21,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2021-12-14 23:26:21,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-14 23:26:21,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2021-12-14 23:26:21,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-14 23:26:21,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-14 23:26:21,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2021-12-14 23:26:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:21,041 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2021-12-14 23:26:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2021-12-14 23:26:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-12-14 23:26:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 45 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2021-12-14 23:26:21,046 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2021-12-14 23:26:21,046 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2021-12-14 23:26:21,046 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:26:21,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2021-12-14 23:26:21,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:21,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:21,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:21,047 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:21,047 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:21,048 INFO L791 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 369#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 370#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 380#L65 assume !parse_expression_list_#t~switch5#1; 372#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 394#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 395#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 381#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 382#L65 assume parse_expression_list_#t~switch5#1; 404#L66-5 [2021-12-14 23:26:21,048 INFO L793 eck$LassoCheckResult]: Loop: 404#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 407#L66-1 assume parse_expression_list_#t~short8#1; 408#L66-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 404#L66-5 [2021-12-14 23:26:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2021-12-14 23:26:21,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:21,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747823065] [2021-12-14 23:26:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:21,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:21,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:21,093 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2021-12-14 23:26:21,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:21,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584031902] [2021-12-14 23:26:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:21,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:21,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:21,099 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2021-12-14 23:26:21,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135681467] [2021-12-14 23:26:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:21,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:21,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:21,120 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:21,542 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:21,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:21,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:21,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:21,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:21,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:21,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:21,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:21,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2021-12-14 23:26:21,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:21,543 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:21,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:21,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:22,069 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:22,069 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:22,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,070 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-14 23:26:22,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:22,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:22,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:22,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,120 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-14 23:26:22,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,164 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-14 23:26:22,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,201 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-14 23:26:22,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-14 23:26:22,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,237 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-14 23:26:22,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,288 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-14 23:26:22,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-14 23:26:22,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,332 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-14 23:26:22,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-14 23:26:22,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,409 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-14 23:26:22,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-14 23:26:22,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,437 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-14 23:26:22,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-14 23:26:22,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,481 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-14 23:26:22,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,533 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-14 23:26:22,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,561 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-14 23:26:22,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-14 23:26:22,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,592 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-14 23:26:22,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,627 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-14 23:26:22,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,668 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-14 23:26:22,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,684 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-14 23:26:22,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,686 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-14 23:26:22,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:22,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:22,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,719 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-14 23:26:22,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:22,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:22,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:22,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:22,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:22,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:22,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:22,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:22,780 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-14 23:26:22,780 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-14 23:26:22,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:22,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:22,781 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:22,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-14 23:26:22,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:22,827 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:26:22,828 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:22,828 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0#1, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2) = -1*ULTIMATE.start_parse_expression_list_~start~0#1 + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2 Supporting invariants [] [2021-12-14 23:26:22,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-14 23:26:22,886 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2021-12-14 23:26:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:22,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 23:26:22,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:22,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:26:22,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:22,984 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 [2021-12-14 23:26:22,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 153 states and 213 transitions. Complement of second has 8 states. [2021-12-14 23:26:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:26:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-12-14 23:26:23,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-14 23:26:23,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:23,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-14 23:26:23,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:23,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-14 23:26:23,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:23,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2021-12-14 23:26:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-12-14 23:26:23,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2021-12-14 23:26:23,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-14 23:26:23,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-12-14 23:26:23,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2021-12-14 23:26:23,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:23,047 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2021-12-14 23:26:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2021-12-14 23:26:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2021-12-14 23:26:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 71 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2021-12-14 23:26:23,051 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2021-12-14 23:26:23,051 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2021-12-14 23:26:23,051 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:26:23,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2021-12-14 23:26:23,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:23,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:23,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:23,052 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:23,052 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:23,053 INFO L791 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 726#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 727#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 738#L65 assume parse_expression_list_#t~switch5#1; 748#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 749#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 735#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 736#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 777#L67 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 741#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 742#L69-8 [2021-12-14 23:26:23,053 INFO L793 eck$LassoCheckResult]: Loop: 742#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 763#L69-1 assume !parse_expression_list_#t~short15#1; 724#L69-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 742#L69-8 [2021-12-14 23:26:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2021-12-14 23:26:23,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799278020] [2021-12-14 23:26:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799278020] [2021-12-14 23:26:23,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799278020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:23,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:23,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 23:26:23,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141592070] [2021-12-14 23:26:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:23,199 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2021-12-14 23:26:23,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069883300] [2021-12-14 23:26:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069883300] [2021-12-14 23:26:23,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069883300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:23,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:23,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:26:23,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552341743] [2021-12-14 23:26:23,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:23,211 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:26:23,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:26:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:26:23,212 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:23,219 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2021-12-14 23:26:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:26:23,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2021-12-14 23:26:23,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:23,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2021-12-14 23:26:23,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-14 23:26:23,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-14 23:26:23,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2021-12-14 23:26:23,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:23,222 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2021-12-14 23:26:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2021-12-14 23:26:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-14 23:26:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 72 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2021-12-14 23:26:23,228 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2021-12-14 23:26:23,228 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2021-12-14 23:26:23,228 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:26:23,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2021-12-14 23:26:23,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:23,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:23,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:23,229 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:23,229 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:23,229 INFO L791 eck$LassoCheckResult]: Stem: 910#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 887#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 883#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 884#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 894#L65 assume parse_expression_list_#t~switch5#1; 942#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 914#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 915#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 945#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 924#L67 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 897#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 898#L69-8 [2021-12-14 23:26:23,229 INFO L793 eck$LassoCheckResult]: Loop: 898#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 917#L69-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 877#L69-2 assume parse_expression_list_#t~short14#1; 878#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 881#L69-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 898#L69-8 [2021-12-14 23:26:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 2 times [2021-12-14 23:26:23,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882487367] [2021-12-14 23:26:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:23,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:23,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882487367] [2021-12-14 23:26:23,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882487367] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:23,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:23,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 23:26:23,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536031443] [2021-12-14 23:26:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:23,401 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2021-12-14 23:26:23,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239511618] [2021-12-14 23:26:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,407 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:23,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:26:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:26:23,461 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:23,568 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2021-12-14 23:26:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:26:23,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2021-12-14 23:26:23,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-14 23:26:23,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2021-12-14 23:26:23,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-14 23:26:23,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-14 23:26:23,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2021-12-14 23:26:23,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:23,571 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2021-12-14 23:26:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2021-12-14 23:26:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2021-12-14 23:26:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.391304347826087) internal successors, (96), 68 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2021-12-14 23:26:23,573 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2021-12-14 23:26:23,573 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2021-12-14 23:26:23,573 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:26:23,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2021-12-14 23:26:23,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:23,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:23,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:23,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:23,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:23,574 INFO L791 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1079#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1075#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1076#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1087#L65 assume parse_expression_list_#t~switch5#1; 1099#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 1100#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 1084#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 1080#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 1081#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 1090#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1091#L69-8 [2021-12-14 23:26:23,574 INFO L793 eck$LassoCheckResult]: Loop: 1091#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1109#L69-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 1069#L69-2 assume parse_expression_list_#t~short14#1; 1070#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 1073#L69-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 1091#L69-8 [2021-12-14 23:26:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2021-12-14 23:26:23,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898926311] [2021-12-14 23:26:23,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,585 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2021-12-14 23:26:23,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043593435] [2021-12-14 23:26:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,604 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2021-12-14 23:26:23,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525544720] [2021-12-14 23:26:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:23,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525544720] [2021-12-14 23:26:23,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525544720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:23,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:23,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 23:26:23,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192784085] [2021-12-14 23:26:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:23,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 23:26:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 23:26:23,692 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. cyclomatic complexity: 33 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:23,747 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2021-12-14 23:26:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:26:23,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2021-12-14 23:26:23,749 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:26:23,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2021-12-14 23:26:23,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-14 23:26:23,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-14 23:26:23,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2021-12-14 23:26:23,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:23,751 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2021-12-14 23:26:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2021-12-14 23:26:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2021-12-14 23:26:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.356164383561644) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2021-12-14 23:26:23,756 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-14 23:26:23,757 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-14 23:26:23,757 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:26:23,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2021-12-14 23:26:23,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:23,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:23,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:23,757 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:23,757 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:23,758 INFO L791 eck$LassoCheckResult]: Stem: 1304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1276#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1277#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1287#L65 assume !parse_expression_list_#t~switch5#1; 1321#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1335#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 1334#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1332#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1330#L65 assume parse_expression_list_#t~switch5#1; 1329#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 1328#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 1326#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 1325#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 1322#L67 assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; 1290#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1291#L69-8 [2021-12-14 23:26:23,758 INFO L793 eck$LassoCheckResult]: Loop: 1291#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1310#L69-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 1270#L69-2 assume parse_expression_list_#t~short14#1; 1271#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 1274#L69-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 1291#L69-8 [2021-12-14 23:26:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -960269984, now seen corresponding path program 1 times [2021-12-14 23:26:23,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177279828] [2021-12-14 23:26:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2021-12-14 23:26:23,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559464207] [2021-12-14 23:26:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:23,779 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1965798457, now seen corresponding path program 1 times [2021-12-14 23:26:23,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:23,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54710904] [2021-12-14 23:26:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:23,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54710904] [2021-12-14 23:26:23,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54710904] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:26:23,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518806251] [2021-12-14 23:26:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:23,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:26:23,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:23,817 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:26:23,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-14 23:26:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:23,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:26:23,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:26:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:23,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518806251] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:26:23,937 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:26:23,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-12-14 23:26:23,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267460733] [2021-12-14 23:26:23,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:26:23,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:26:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:26:23,990 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:24,085 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2021-12-14 23:26:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 23:26:24,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2021-12-14 23:26:24,088 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-14 23:26:24,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2021-12-14 23:26:24,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-14 23:26:24,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-14 23:26:24,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2021-12-14 23:26:24,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:24,089 INFO L681 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2021-12-14 23:26:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2021-12-14 23:26:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2021-12-14 23:26:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 111 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2021-12-14 23:26:24,092 INFO L704 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2021-12-14 23:26:24,092 INFO L587 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2021-12-14 23:26:24,092 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:26:24,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2021-12-14 23:26:24,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:26:24,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:24,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:24,093 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:24,093 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:26:24,093 INFO L791 eck$LassoCheckResult]: Stem: 1680#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1656#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1652#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1653#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1664#L65 assume !parse_expression_list_#t~switch5#1; 1748#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1751#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 1750#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1749#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1747#L65 assume !parse_expression_list_#t~switch5#1; 1713#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1754#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 1752#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1716#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 1712#L65 assume parse_expression_list_#t~switch5#1; 1714#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 1729#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 1755#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 1657#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 1658#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 1667#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1668#L69-8 [2021-12-14 23:26:24,093 INFO L793 eck$LassoCheckResult]: Loop: 1668#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1686#L69-1 assume parse_expression_list_#t~short15#1;call parse_expression_list_#t~mem12#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short14#1 := 32 == parse_expression_list_#t~mem12#1; 1646#L69-2 assume parse_expression_list_#t~short14#1; 1647#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 1650#L69-6 assume !!parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1;parse_expression_list_#t~post16#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post16#1 - 1;havoc parse_expression_list_#t~post16#1; 1668#L69-8 [2021-12-14 23:26:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 1 times [2021-12-14 23:26:24,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:24,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243252937] [2021-12-14 23:26:24,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:24,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:24,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:24,110 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2021-12-14 23:26:24,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120703933] [2021-12-14 23:26:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:24,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:24,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:24,133 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 1 times [2021-12-14 23:26:24,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:24,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247712696] [2021-12-14 23:26:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:24,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:24,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:24,150 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:24,714 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:26:24,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:26:24,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:26:24,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:26:24,714 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:26:24,714 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:24,714 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:26:24,714 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:26:24,714 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration8_Lasso [2021-12-14 23:26:24,714 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:26:24,714 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:26:24,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:24,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:26:25,399 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:26:25,399 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:26:25,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,400 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-14 23:26:25,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,428 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-14 23:26:25,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:25,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:25,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,462 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-14 23:26:25,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,505 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-14 23:26:25,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-14 23:26:25,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,530 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-14 23:26:25,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,555 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-14 23:26:25,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-14 23:26:25,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,580 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-14 23:26:25,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:25,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:25,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,606 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-14 23:26:25,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-14 23:26:25,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,642 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-14 23:26:25,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-14 23:26:25,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,668 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-14 23:26:25,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-14 23:26:25,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,700 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-14 23:26:25,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-14 23:26:25,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,736 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-14 23:26:25,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:25,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:25,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-14 23:26:25,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,761 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-14 23:26:25,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-14 23:26:25,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,785 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-14 23:26:25,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,808 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-14 23:26:25,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-14 23:26:25,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,832 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-14 23:26:25,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-14 23:26:25,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,856 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-14 23:26:25,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-14 23:26:25,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,881 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-14 23:26:25,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:26:25,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:26:25,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:26:25,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:26:25,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:25,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,907 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-14 23:26:25,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:26:25,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:26:25,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:26:25,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:26:25,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:26:25,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:26:25,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:26:25,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:26:25,953 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-14 23:26:25,953 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-12-14 23:26:25,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:26:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:25,954 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:26:25,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-14 23:26:25,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:26:25,964 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:26:25,964 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:26:25,964 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0#1) = 1*ULTIMATE.start_parse_expression_list_~j~0#1 Supporting invariants [] [2021-12-14 23:26:25,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:26,030 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2021-12-14 23:26:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:26,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:26:26,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:26,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:26:26,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:26,164 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 [2021-12-14 23:26:26,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:26,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 267 states and 360 transitions. Complement of second has 11 states. [2021-12-14 23:26:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-14 23:26:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2021-12-14 23:26:26,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2021-12-14 23:26:26,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:26,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2021-12-14 23:26:26,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:26,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2021-12-14 23:26:26,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:26:26,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2021-12-14 23:26:26,233 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2021-12-14 23:26:26,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2021-12-14 23:26:26,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:26:26,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:26:26,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2021-12-14 23:26:26,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:26,235 INFO L681 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2021-12-14 23:26:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2021-12-14 23:26:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2021-12-14 23:26:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 117 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2021-12-14 23:26:26,238 INFO L704 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2021-12-14 23:26:26,238 INFO L587 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2021-12-14 23:26:26,238 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:26:26,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2021-12-14 23:26:26,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:26:26,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:26,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:26,240 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:26,240 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:26,240 INFO L791 eck$LassoCheckResult]: Stem: 2304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2274#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2275#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2288#L65 assume parse_expression_list_#t~switch5#1; 2342#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2341#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 2340#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 2339#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2338#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2337#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2336#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2335#L69-1 assume !parse_expression_list_#t~short15#1; 2334#L69-6 assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; 2333#L69-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 2332#L70 assume !parse_expression_list_#t~short18#1; 2331#L70-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 2330#L70-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1;assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; 2329#L41 parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2328#L14 assume !(0 == __VERIFIER_assert_~cond#1); 2327#L14-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); 2326#L71 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 2325#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2324#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2323#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2322#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2320#L65 assume parse_expression_list_#t~switch5#1; 2284#L66-5 [2021-12-14 23:26:26,240 INFO L793 eck$LassoCheckResult]: Loop: 2284#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2319#L66-1 assume parse_expression_list_#t~short8#1; 2283#L66-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 2284#L66-5 [2021-12-14 23:26:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2021-12-14 23:26:26,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:26,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077183893] [2021-12-14 23:26:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:26,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:26:26,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077183893] [2021-12-14 23:26:26,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077183893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:26:26,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:26:26,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:26:26,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336142008] [2021-12-14 23:26:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:26:26,293 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2021-12-14 23:26:26,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928569939] [2021-12-14 23:26:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:26,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:26,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:26,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:26,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:26,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:26:26,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:26:26,336 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. cyclomatic complexity: 49 Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:26,395 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2021-12-14 23:26:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:26:26,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 162 transitions. [2021-12-14 23:26:26,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:26,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 108 states and 147 transitions. [2021-12-14 23:26:26,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-14 23:26:26,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-14 23:26:26,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 147 transitions. [2021-12-14 23:26:26,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:26:26,397 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 147 transitions. [2021-12-14 23:26:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 147 transitions. [2021-12-14 23:26:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2021-12-14 23:26:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 87 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2021-12-14 23:26:26,399 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2021-12-14 23:26:26,399 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2021-12-14 23:26:26,399 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:26:26,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2021-12-14 23:26:26,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-14 23:26:26,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:26:26,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:26:26,400 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:26:26,400 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:26:26,400 INFO L791 eck$LassoCheckResult]: Stem: 2552#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret21#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2524#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2525#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2536#L65 assume !parse_expression_list_#t~switch5#1; 2555#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2546#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2547#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2537#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2538#L65 assume parse_expression_list_#t~switch5#1; 2549#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2550#L66-1 assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; 2535#L66-3 assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; 2531#L66-6 call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2532#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2541#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2542#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2558#L69-1 assume !parse_expression_list_#t~short15#1; 2559#L69-6 assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; 2569#L69-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 2568#L70 assume !parse_expression_list_#t~short18#1; 2567#L70-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 2543#L70-4 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1;assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; 2544#L41 parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2556#L14 assume !(0 == __VERIFIER_assert_~cond#1); 2545#L14-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); 2526#L71 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 2527#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2584#L62-1 call parse_expression_list_#t~mem2#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2576#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2574#L62-4 parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; 2571#L65 assume parse_expression_list_#t~switch5#1; 2534#L66-5 [2021-12-14 23:26:26,401 INFO L793 eck$LassoCheckResult]: Loop: 2534#L66-5 call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; 2548#L66-1 assume parse_expression_list_#t~short8#1; 2533#L66-3 assume !!parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1;parse_expression_list_#t~post9#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post9#1;havoc parse_expression_list_#t~post9#1; 2534#L66-5 [2021-12-14 23:26:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2021-12-14 23:26:26,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:26,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708668960] [2021-12-14 23:26:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:26,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:26,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:26:26,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:26:26,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708668960] [2021-12-14 23:26:26,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708668960] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:26:26,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116457631] [2021-12-14 23:26:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:26,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:26:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:26:26,490 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:26:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-12-14 23:26:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:26:26,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 23:26:26,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:26:26,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 23:26:26,679 INFO L388 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 16 treesize of output 18 [2021-12-14 23:26:26,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 23:26:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:26:26,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:26:26,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_parse_expression_list_~#str2~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_parse_expression_list_~str#1.base|) (+ |c_ULTIMATE.start_parse_expression_list_~i~0#1| |c_ULTIMATE.start_parse_expression_list_~str#1.offset|)) 0)) is different from false [2021-12-14 23:26:26,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-14 23:26:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:26:26,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116457631] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:26:26,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:26:26,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-12-14 23:26:26,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633900515] [2021-12-14 23:26:26,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:26:26,810 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:26:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:26:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2021-12-14 23:26:26,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:26:26,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156498062] [2021-12-14 23:26:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:26:26,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:26:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:26,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:26:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:26:26,822 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:26:26,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:26:26,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 23:26:26,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2021-12-14 23:26:26,854 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:26:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:26:26,918 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2021-12-14 23:26:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:26:26,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 82 transitions. [2021-12-14 23:26:26,919 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:26:26,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2021-12-14 23:26:26,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:26:26,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:26:26,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:26:26,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:26:26,920 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:26:26,920 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:26:26,920 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:26:26,920 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-14 23:26:26,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-14 23:26:26,920 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:26:26,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-14 23:26:26,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:26:26 BoogieIcfgContainer [2021-12-14 23:26:26,924 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:26:26,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:26:26,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:26:26,925 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:26:26,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:26:18" (3/4) ... [2021-12-14 23:26:26,927 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 23:26:26,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:26:26,928 INFO L158 Benchmark]: Toolchain (without parser) took 9451.93ms. Allocated memory was 88.1MB in the beginning and 140.5MB in the end (delta: 52.4MB). Free memory was 55.1MB in the beginning and 53.4MB in the end (delta: 1.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2021-12-14 23:26:26,928 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:26:26,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.17ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.9MB in the beginning and 84.9MB in the end (delta: -30.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 23:26:26,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.89ms. Allocated memory is still 111.1MB. Free memory was 84.9MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:26:26,928 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 111.1MB. Free memory was 83.0MB in the beginning and 81.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:26:26,928 INFO L158 Benchmark]: RCFGBuilder took 347.27ms. Allocated memory is still 111.1MB. Free memory was 81.6MB in the beginning and 68.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 23:26:26,929 INFO L158 Benchmark]: BuchiAutomizer took 8771.33ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 68.3MB in the beginning and 53.4MB in the end (delta: 14.9MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2021-12-14 23:26:26,929 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 140.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:26:26,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.17ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.9MB in the beginning and 84.9MB in the end (delta: -30.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.89ms. Allocated memory is still 111.1MB. Free memory was 84.9MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 111.1MB. Free memory was 83.0MB in the beginning and 81.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.27ms. Allocated memory is still 111.1MB. Free memory was 81.6MB in the beginning and 68.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 8771.33ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 68.3MB in the beginning and 53.4MB in the end (delta: 14.9MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 140.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[str] + -1 * str and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start and consists of 5 locations. One deterministic module has affine ranking function j and consists of 6 locations. 7 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 7.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 237 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 926 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 27 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 316 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax100 hnf100 lsp92 ukn84 mio100 lsp31 div100 bol100 ite100 ukn100 eq194 hnf89 smp100 dnf207 smp74 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms 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! [2021-12-14 23:26:26,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-14 23:26:27,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE