./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 e19ca921 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-dev-e19ca92 [2021-12-22 20:12:46,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 20:12:46,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 20:12:46,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 20:12:46,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 20:12:46,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 20:12:46,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 20:12:46,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 20:12:46,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 20:12:46,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 20:12:46,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 20:12:46,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 20:12:46,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 20:12:46,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 20:12:46,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 20:12:46,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 20:12:46,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 20:12:46,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 20:12:46,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 20:12:46,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 20:12:46,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 20:12:46,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 20:12:46,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 20:12:46,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 20:12:46,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 20:12:46,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 20:12:46,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 20:12:46,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 20:12:46,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 20:12:46,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 20:12:46,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 20:12:46,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 20:12:46,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 20:12:46,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 20:12:46,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 20:12:46,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 20:12:46,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 20:12:46,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 20:12:46,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 20:12:46,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 20:12:46,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 20:12:46,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 20:12:46,509 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 20:12:46,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 20:12:46,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 20:12:46,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 20:12:46,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 20:12:46,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 20:12:46,513 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 20:12:46,514 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 20:12:46,514 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 20:12:46,514 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 20:12:46,515 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 20:12:46,515 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 20:12:46,516 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 20:12:46,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 20:12:46,516 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 20:12:46,516 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 20:12:46,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 20:12:46,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 20:12:46,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 20:12:46,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 20:12:46,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 20:12:46,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 20:12:46,517 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 20:12:46,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 20:12:46,518 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 20:12:46,518 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 20:12:46,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 20:12:46,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 20:12:46,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 20:12:46,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 20:12:46,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 20:12:46,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 20:12:46,520 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 20:12:46,520 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-22 20:12:46,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 20:12:46,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 20:12:46,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 20:12:46,771 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 20:12:46,772 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 20:12:46,773 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-22 20:12:46,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f89a2ba/4a24a51fc0ad488cb5fced290baa924c/FLAGd8216bda2 [2021-12-22 20:12:47,267 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 20:12:47,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-12-22 20:12:47,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f89a2ba/4a24a51fc0ad488cb5fced290baa924c/FLAGd8216bda2 [2021-12-22 20:12:47,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f89a2ba/4a24a51fc0ad488cb5fced290baa924c [2021-12-22 20:12:47,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 20:12:47,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 20:12:47,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 20:12:47,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 20:12:47,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 20:12:47,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:47,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60016e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47, skipping insertion in model container [2021-12-22 20:12:47,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:47,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 20:12:47,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 20:12:47,876 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-22 20:12:47,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:12:47,915 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 20:12:47,931 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-22 20:12:47,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:12:47,974 INFO L208 MainTranslator]: Completed translation [2021-12-22 20:12:47,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47 WrapperNode [2021-12-22 20:12:47,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 20:12:47,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 20:12:47,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 20:12:47,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 20:12:47,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:47,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,020 INFO L137 Inliner]: procedures = 41, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2021-12-22 20:12:48,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 20:12:48,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 20:12:48,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 20:12:48,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 20:12:48,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 20:12:48,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 20:12:48,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 20:12:48,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 20:12:48,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (1/1) ... [2021-12-22 20:12:48,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:48,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:48,096 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-22 20:12:48,108 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-22 20:12:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 20:12:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 20:12:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 20:12:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 20:12:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 20:12:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-12-22 20:12:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 20:12:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 20:12:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 20:12:48,220 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 20:12:48,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 20:12:48,418 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 20:12:48,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 20:12:48,424 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-22 20:12:48,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:12:48 BoogieIcfgContainer [2021-12-22 20:12:48,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 20:12:48,427 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 20:12:48,427 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 20:12:48,430 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 20:12:48,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:12:48,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 08:12:47" (1/3) ... [2021-12-22 20:12:48,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47dc92c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:12:48, skipping insertion in model container [2021-12-22 20:12:48,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:12:48,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:12:47" (2/3) ... [2021-12-22 20:12:48,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47dc92c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:12:48, skipping insertion in model container [2021-12-22 20:12:48,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:12:48,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:12:48" (3/3) ... [2021-12-22 20:12:48,434 INFO L388 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2021-12-22 20:12:48,470 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 20:12:48,470 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 20:12:48,471 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 20:12:48,471 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 20:12:48,471 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 20:12:48,471 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 20:12:48,471 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 20:12:48,471 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 20:12:48,496 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-22 20:12:48,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-22 20:12:48,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:48,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:48,516 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-22 20:12:48,516 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:48,516 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 20:12:48,517 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-22 20:12:48,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-22 20:12:48,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:48,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:48,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-22 20:12:48,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:48,526 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-22 20:12:48,526 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-22 20:12:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-12-22 20:12:48,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:48,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331371885] [2021-12-22 20:12:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:48,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:48,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:48,676 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2021-12-22 20:12:48,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:48,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531031513] [2021-12-22 20:12:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:48,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:48,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:48,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:48,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2021-12-22 20:12:48,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:48,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835437075] [2021-12-22 20:12:48,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:48,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:48,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:48,766 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:49,238 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:12:49,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:12:49,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:12:49,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:12:49,240 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:12:49,240 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:49,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:12:49,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:12:49,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2021-12-22 20:12:49,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:12:49,241 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:12:49,258 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-22 20:12:49,263 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-22 20:12:49,266 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-22 20:12:49,267 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-22 20:12:49,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-22 20:12:49,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-22 20:12:49,275 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-22 20:12:49,277 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-22 20:12:49,279 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-22 20:12:49,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-22 20:12:49,283 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-22 20:12:49,566 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-22 20:12:49,569 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-22 20:12:49,571 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-22 20:12:49,574 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-22 20:12:49,576 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-22 20:12:49,580 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-22 20:12:49,582 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-22 20:12:49,584 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-22 20:12:49,586 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-22 20:12:49,588 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-22 20:12:49,590 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-22 20:12:49,591 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-22 20:12:49,593 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-22 20:12:49,595 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-22 20:12:49,597 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-22 20:12:49,599 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-22 20:12:49,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:12:49,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:12:49,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:12:49,857 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:12:49,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:49,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:49,860 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-22 20:12:49,873 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-22 20:12:49,874 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-22 20:12:49,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:49,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:49,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:49,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:49,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:49,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:49,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:49,925 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-22 20:12:49,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:49,927 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-22 20:12:49,928 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-22 20:12:49,935 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-22 20:12:49,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:49,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:49,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:49,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:49,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:49,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:49,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:49,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:49,973 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-22 20:12:49,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:49,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:49,975 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-22 20:12:49,978 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-22 20:12:49,979 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-22 20:12:49,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:49,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:49,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:49,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:49,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:49,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:49,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:49,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,019 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-22 20:12:50,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,021 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-22 20:12:50,023 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-22 20:12:50,023 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-22 20:12:50,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:50,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:50,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:50,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,068 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-22 20:12:50,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,070 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-22 20:12:50,072 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-22 20:12:50,073 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-22 20:12:50,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:50,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:50,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:50,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,108 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-22 20:12:50,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,110 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-22 20:12:50,111 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-22 20:12:50,115 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-22 20:12:50,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,160 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-22 20:12:50,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,163 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-22 20:12:50,165 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-22 20:12:50,166 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-22 20:12:50,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,226 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-22 20:12:50,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,228 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-22 20:12:50,230 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-22 20:12:50,231 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-22 20:12:50,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:50,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:50,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:50,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,277 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-22 20:12:50,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,279 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-22 20:12:50,280 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-22 20:12:50,281 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-22 20:12:50,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:50,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:50,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:50,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,322 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-22 20:12:50,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,324 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-22 20:12:50,325 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-22 20:12:50,327 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-22 20:12:50,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:50,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:50,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:50,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,367 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-22 20:12:50,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,370 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-22 20:12:50,372 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-22 20:12:50,373 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-22 20:12:50,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-22 20:12:50,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,404 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-22 20:12:50,406 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-22 20:12:50,407 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-22 20:12:50,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:50,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,457 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-22 20:12:50,458 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-22 20:12:50,460 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-22 20:12:50,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:50,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,466 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-22 20:12:50,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,467 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-22 20:12:50,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:50,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,500 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-22 20:12:50,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,501 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-22 20:12:50,502 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-22 20:12:50,503 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-22 20:12:50,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,550 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-22 20:12:50,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,551 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-22 20:12:50,553 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-22 20:12:50,553 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-22 20:12:50,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:50,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:50,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,595 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-22 20:12:50,597 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-22 20:12:50,598 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-22 20:12:50,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:50,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:50,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:50,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:50,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:50,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:50,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:12:50,700 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-22 20:12:50,700 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-22 20:12:50,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:50,710 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-22 20:12:50,759 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-22 20:12:50,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:12:50,781 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 20:12:50,781 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:12:50,782 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-22 20:12:50,817 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-22 20:12:50,884 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2021-12-22 20:12:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:50,915 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-22 20:12:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:50,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 20:12:50,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:50,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:12:50,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:50,991 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-22 20:12:51,015 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-22 20:12:51,016 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-22 20:12:51,061 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-22 20:12:51,062 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-22 20:12:51,066 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-22 20:12:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2021-12-22 20:12:51,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2021-12-22 20:12:51,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:51,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2021-12-22 20:12:51,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:51,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2021-12-22 20:12:51,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:51,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2021-12-22 20:12:51,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:51,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2021-12-22 20:12:51,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-22 20:12:51,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-22 20:12:51,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2021-12-22 20:12:51,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:51,076 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2021-12-22 20:12:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2021-12-22 20:12:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-12-22 20:12:51,093 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-22 20:12:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2021-12-22 20:12:51,094 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2021-12-22 20:12:51,094 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2021-12-22 20:12:51,094 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 20:12:51,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2021-12-22 20:12:51,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:51,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:51,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:51,095 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:51,095 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:12:51,096 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-22 20:12:51,096 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-22 20:12:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2021-12-22 20:12:51,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:51,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138828973] [2021-12-22 20:12:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:51,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,119 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2021-12-22 20:12:51,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:51,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299457878] [2021-12-22 20:12:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:51,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,127 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:51,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2021-12-22 20:12:51,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:51,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60443488] [2021-12-22 20:12:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:51,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:51,222 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-22 20:12:51,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:51,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60443488] [2021-12-22 20:12:51,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60443488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:51,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:12:51,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 20:12:51,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517678929] [2021-12-22 20:12:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:51,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:51,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 20:12:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 20:12:51,265 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-22 20:12:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:51,339 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2021-12-22 20:12:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 20:12:51,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2021-12-22 20:12:51,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-22 20:12:51,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2021-12-22 20:12:51,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-22 20:12:51,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-22 20:12:51,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2021-12-22 20:12:51,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:51,343 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2021-12-22 20:12:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2021-12-22 20:12:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-12-22 20:12:51,345 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-22 20:12:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2021-12-22 20:12:51,345 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2021-12-22 20:12:51,345 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2021-12-22 20:12:51,345 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 20:12:51,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2021-12-22 20:12:51,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:51,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:51,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:51,347 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:12:51,347 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:12:51,347 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-22 20:12:51,347 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-22 20:12:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2021-12-22 20:12:51,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637026340] [2021-12-22 20:12:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:51,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2021-12-22 20:12:51,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:51,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619701283] [2021-12-22 20:12:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:51,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,409 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2021-12-22 20:12:51,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:51,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55519715] [2021-12-22 20:12:51,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:51,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:51,448 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:51,888 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:12:51,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:12:51,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:12:51,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:12:51,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:12:51,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:51,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:12:51,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:12:51,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2021-12-22 20:12:51,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:12:51,889 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:12:51,891 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-22 20:12:51,897 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-22 20:12:51,899 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-22 20:12:52,245 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-22 20:12:52,247 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-22 20:12:52,249 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-22 20:12:52,251 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-22 20:12:52,253 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-22 20:12:52,255 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-22 20:12:52,256 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-22 20:12:52,258 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-22 20:12:52,259 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-22 20:12:52,261 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-22 20:12:52,262 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-22 20:12:52,264 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-22 20:12:52,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-22 20:12:52,267 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-22 20:12:52,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-22 20:12:52,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-22 20:12:52,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-22 20:12:52,273 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-22 20:12:52,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-22 20:12:52,275 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-22 20:12:52,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-22 20:12:52,279 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-22 20:12:52,280 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-22 20:12:52,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-22 20:12:52,553 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:12:52,553 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:12:52,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,558 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-22 20:12:52,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-22 20:12:52,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:52,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:52,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:52,573 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-22 20:12:52,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,604 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-22 20:12:52,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,606 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-22 20:12:52,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-22 20:12:52,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,620 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-22 20:12:52,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,648 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-22 20:12:52,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,649 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-22 20:12:52,651 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-22 20:12:52,652 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-22 20:12:52,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,714 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-22 20:12:52,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,716 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-22 20:12:52,717 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-22 20:12:52,718 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-22 20:12:52,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,757 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-22 20:12:52,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,759 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-22 20:12:52,761 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-22 20:12:52,761 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-22 20:12:52,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,827 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-22 20:12:52,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,829 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-22 20:12:52,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-22 20:12:52,835 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-22 20:12:52,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:52,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,887 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-22 20:12:52,889 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-22 20:12:52,890 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-22 20:12:52,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:52,959 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-22 20:12:52,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:52,961 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-22 20:12:52,963 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-22 20:12:52,964 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-22 20:12:52,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:52,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:52,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:52,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:52,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:52,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:52,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:53,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,010 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-22 20:12:53,011 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-22 20:12:53,013 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-22 20:12:53,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:53,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,062 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-22 20:12:53,064 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-22 20:12:53,064 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-22 20:12:53,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,108 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-22 20:12:53,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,110 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-22 20:12:53,111 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-22 20:12:53,112 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-22 20:12:53,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,157 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-22 20:12:53,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,159 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-22 20:12:53,160 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-22 20:12:53,161 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-22 20:12:53,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:53,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,211 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-22 20:12:53,213 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-22 20:12:53,214 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-22 20:12:53,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,263 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-22 20:12:53,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,265 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-22 20:12:53,267 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-22 20:12:53,268 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-22 20:12:53,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,317 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-22 20:12:53,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,318 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-22 20:12:53,330 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-22 20:12:53,330 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-22 20:12:53,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,338 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-22 20:12:53,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,340 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-22 20:12:53,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:53,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-22 20:12:53,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,369 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-22 20:12:53,370 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-22 20:12:53,371 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-22 20:12:53,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:53,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:53,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:53,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:53,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:53,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:53,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:12:53,414 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-22 20:12:53,414 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-22 20:12:53,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:53,416 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-22 20:12:53,417 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-22 20:12:53,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:12:53,452 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 20:12:53,453 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:12:53,453 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-22 20:12:53,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:53,548 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2021-12-22 20:12:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:53,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 20:12:53,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:53,629 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-22 20:12:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:53,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 20:12:53,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:53,693 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-22 20:12:53,694 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-22 20:12:53,694 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-22 20:12:53,751 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-22 20:12:53,752 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-22 20:12:53,753 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-22 20:12:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-12-22 20:12:53,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-22 20:12:53,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:53,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-22 20:12:53,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:53,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-22 20:12:53,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:53,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2021-12-22 20:12:53,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-12-22 20:12:53,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2021-12-22 20:12:53,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-22 20:12:53,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-12-22 20:12:53,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2021-12-22 20:12:53,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:53,759 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2021-12-22 20:12:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2021-12-22 20:12:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2021-12-22 20:12:53,763 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-22 20:12:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2021-12-22 20:12:53,763 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2021-12-22 20:12:53,764 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2021-12-22 20:12:53,764 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 20:12:53,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2021-12-22 20:12:53,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:53,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:53,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:53,765 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:12:53,765 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:12:53,765 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-22 20:12:53,765 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-22 20:12:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2021-12-22 20:12:53,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:53,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069073860] [2021-12-22 20:12:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:53,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:53,926 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-22 20:12:53,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069073860] [2021-12-22 20:12:53,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069073860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:53,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:12:53,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 20:12:53,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828994096] [2021-12-22 20:12:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:53,927 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:12:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2021-12-22 20:12:53,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648359462] [2021-12-22 20:12:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:53,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:53,936 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-22 20:12:53,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:53,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648359462] [2021-12-22 20:12:53,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648359462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:53,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:12:53,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:12:53,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141009797] [2021-12-22 20:12:53,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:53,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:12:53,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:53,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:12:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:12:53,938 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-22 20:12:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:53,946 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2021-12-22 20:12:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:12:53,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2021-12-22 20:12:53,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:53,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2021-12-22 20:12:53,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-22 20:12:53,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-22 20:12:53,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2021-12-22 20:12:53,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:53,950 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2021-12-22 20:12:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2021-12-22 20:12:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-22 20:12:53,953 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-22 20:12:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2021-12-22 20:12:53,954 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2021-12-22 20:12:53,954 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2021-12-22 20:12:53,954 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 20:12:53,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2021-12-22 20:12:53,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:53,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:53,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:53,955 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:12:53,955 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:53,955 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-22 20:12:53,955 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-22 20:12:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 2 times [2021-12-22 20:12:53,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:53,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523288669] [2021-12-22 20:12:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:53,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:54,106 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-22 20:12:54,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:54,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523288669] [2021-12-22 20:12:54,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523288669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:54,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:12:54,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 20:12:54,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757069749] [2021-12-22 20:12:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:54,107 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:12:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2021-12-22 20:12:54,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879047333] [2021-12-22 20:12:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,114 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 20:12:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 20:12:54,178 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-22 20:12:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:54,268 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2021-12-22 20:12:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 20:12:54,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2021-12-22 20:12:54,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-22 20:12:54,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2021-12-22 20:12:54,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-22 20:12:54,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-22 20:12:54,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2021-12-22 20:12:54,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:54,271 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2021-12-22 20:12:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2021-12-22 20:12:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2021-12-22 20:12:54,296 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-22 20:12:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2021-12-22 20:12:54,296 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2021-12-22 20:12:54,296 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2021-12-22 20:12:54,296 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-22 20:12:54,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2021-12-22 20:12:54,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:54,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:54,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:54,297 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:12:54,298 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:54,298 INFO L791 eck$LassoCheckResult]: Stem: 1100#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); 1077#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); 1073#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1074#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; 1084#L65 assume parse_expression_list_#t~switch5#1; 1096#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; 1097#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; 1082#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; 1078#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); 1079#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 1087#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1088#L69-8 [2021-12-22 20:12:54,298 INFO L793 eck$LassoCheckResult]: Loop: 1088#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1106#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; 1067#L69-2 assume parse_expression_list_#t~short14#1; 1068#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 1071#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; 1088#L69-8 [2021-12-22 20:12:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2021-12-22 20:12:54,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941771408] [2021-12-22 20:12:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2021-12-22 20:12:54,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524668408] [2021-12-22 20:12:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2021-12-22 20:12:54,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642289919] [2021-12-22 20:12:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:54,405 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-22 20:12:54,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:54,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642289919] [2021-12-22 20:12:54,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642289919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:54,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:12:54,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 20:12:54,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766584902] [2021-12-22 20:12:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:54,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:54,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 20:12:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 20:12:54,464 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-22 20:12:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:54,515 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2021-12-22 20:12:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 20:12:54,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2021-12-22 20:12:54,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-22 20:12:54,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2021-12-22 20:12:54,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-22 20:12:54,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-22 20:12:54,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2021-12-22 20:12:54,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:54,518 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2021-12-22 20:12:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2021-12-22 20:12:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2021-12-22 20:12:54,520 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-22 20:12:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2021-12-22 20:12:54,521 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-22 20:12:54,521 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-22 20:12:54,521 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-22 20:12:54,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2021-12-22 20:12:54,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:54,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:54,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:54,522 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:12:54,522 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:54,522 INFO L791 eck$LassoCheckResult]: Stem: 1302#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); 1278#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); 1274#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1275#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; 1285#L65 assume !parse_expression_list_#t~switch5#1; 1319#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1333#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); 1332#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1330#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; 1328#L65 assume parse_expression_list_#t~switch5#1; 1327#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; 1306#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; 1283#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; 1279#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); 1280#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 1288#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1289#L69-8 [2021-12-22 20:12:54,522 INFO L793 eck$LassoCheckResult]: Loop: 1289#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1308#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; 1268#L69-2 assume parse_expression_list_#t~short14#1; 1269#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 1272#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; 1289#L69-8 [2021-12-22 20:12:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash -960269922, now seen corresponding path program 1 times [2021-12-22 20:12:54,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342036593] [2021-12-22 20:12:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,572 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2021-12-22 20:12:54,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568403727] [2021-12-22 20:12:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,581 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -554161477, now seen corresponding path program 1 times [2021-12-22 20:12:54,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374572261] [2021-12-22 20:12:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:54,631 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-22 20:12:54,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:54,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374572261] [2021-12-22 20:12:54,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374572261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:12:54,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393694371] [2021-12-22 20:12:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:12:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:54,633 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-22 20:12:54,635 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-22 20:12:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:54,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 20:12:54,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:54,723 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-22 20:12:54,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:12:54,769 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-22 20:12:54,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393694371] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:12:54,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 20:12:54,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-12-22 20:12:54,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838310303] [2021-12-22 20:12:54,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 20:12:54,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:54,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 20:12:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-22 20:12:54,825 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-22 20:12:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:54,913 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2021-12-22 20:12:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 20:12:54,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2021-12-22 20:12:54,916 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-22 20:12:54,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2021-12-22 20:12:54,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-22 20:12:54,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-22 20:12:54,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2021-12-22 20:12:54,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:54,917 INFO L681 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2021-12-22 20:12:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2021-12-22 20:12:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2021-12-22 20:12:54,919 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-22 20:12:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2021-12-22 20:12:54,920 INFO L704 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2021-12-22 20:12:54,920 INFO L587 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2021-12-22 20:12:54,920 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-22 20:12:54,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2021-12-22 20:12:54,920 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-22 20:12:54,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:54,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:54,921 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:12:54,921 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:12:54,921 INFO L791 eck$LassoCheckResult]: Stem: 1683#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); 1654#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); 1650#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1651#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; 1744#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1743#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); 1742#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1741#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; 1738#L65 assume !parse_expression_list_#t~switch5#1; 1704#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 1750#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); 1709#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 1708#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; 1703#L65 assume parse_expression_list_#t~switch5#1; 1705#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; 1676#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; 1754#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; 1753#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); 1680#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-22 20:12:54,921 INFO L793 eck$LassoCheckResult]: Loop: 1668#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 1688#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; 1644#L69-2 assume parse_expression_list_#t~short14#1; 1645#L69-4 parse_expression_list_#t~short15#1 := parse_expression_list_#t~short14#1; 1648#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-22 20:12:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 2 times [2021-12-22 20:12:54,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266625913] [2021-12-22 20:12:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,938 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2021-12-22 20:12:54,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280215398] [2021-12-22 20:12:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,942 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 2 times [2021-12-22 20:12:54,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981713197] [2021-12-22 20:12:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:54,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:54,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:55,579 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:12:55,579 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:12:55,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:12:55,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:12:55,579 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:12:55,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:55,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:12:55,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:12:55,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration8_Lasso [2021-12-22 20:12:55,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:12:55,579 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:12:55,581 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-22 20:12:55,583 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-22 20:12:55,585 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-22 20:12:55,587 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-22 20:12:55,588 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-22 20:12:55,590 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-22 20:12:55,591 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-22 20:12:55,593 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-22 20:12:55,597 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-22 20:12:55,599 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-22 20:12:55,601 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-22 20:12:55,603 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-22 20:12:55,604 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-22 20:12:55,606 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-22 20:12:56,022 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-22 20:12:56,024 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-22 20:12:56,025 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-22 20:12:56,027 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-22 20:12:56,028 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-22 20:12:56,030 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-22 20:12:56,031 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-22 20:12:56,033 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-22 20:12:56,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-22 20:12:56,036 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-22 20:12:56,037 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-22 20:12:56,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-22 20:12:56,444 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:12:56,444 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:12:56,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,469 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-22 20:12:56,470 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-22 20:12:56,471 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-22 20:12:56,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-22 20:12:56,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,505 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-22 20:12:56,506 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-22 20:12:56,507 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-22 20:12:56,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:56,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:56,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,550 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-22 20:12:56,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,551 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-22 20:12:56,568 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-22 20:12:56,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,577 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-22 20:12:56,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,614 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-22 20:12:56,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,615 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-22 20:12:56,618 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-22 20:12:56,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,627 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-22 20:12:56,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:56,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,653 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-22 20:12:56,654 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-22 20:12:56,655 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-22 20:12:56,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,681 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-22 20:12:56,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,688 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-22 20:12:56,690 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-22 20:12:56,691 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-22 20:12:56,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:56,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:56,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:56,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,718 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-22 20:12:56,719 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-22 20:12:56,720 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-22 20:12:56,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,744 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-22 20:12:56,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,746 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-22 20:12:56,747 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-22 20:12:56,750 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-22 20:12:56,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:56,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,812 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-22 20:12:56,824 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-22 20:12:56,825 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-22 20:12:56,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:56,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,858 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-22 20:12:56,861 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-22 20:12:56,862 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-22 20:12:56,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:56,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,896 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-22 20:12:56,897 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-22 20:12:56,898 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-22 20:12:56,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:56,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:56,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:56,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,925 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-22 20:12:56,926 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-22 20:12:56,927 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-22 20:12:56,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:56,964 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-22 20:12:56,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:56,965 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-22 20:12:56,967 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-22 20:12:56,968 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-22 20:12:56,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:56,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:12:56,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:56,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:56,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:56,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:12:56,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:12:56,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,007 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-22 20:12:57,008 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-22 20:12:57,009 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-22 20:12:57,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,043 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-22 20:12:57,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,045 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-22 20:12:57,046 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-22 20:12:57,047 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-22 20:12:57,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,090 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-22 20:12:57,090 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-22 20:12:57,092 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-22 20:12:57,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,127 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-22 20:12:57,128 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-22 20:12:57,129 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-22 20:12:57,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,180 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-22 20:12:57,181 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-22 20:12:57,182 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-22 20:12:57,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,214 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-22 20:12:57,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,215 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-22 20:12:57,216 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-22 20:12:57,217 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-22 20:12:57,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-22 20:12:57,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,255 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-22 20:12:57,255 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-22 20:12:57,257 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-22 20:12:57,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,299 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-22 20:12:57,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,300 INFO L229 MonitoredProcess]: Starting monitored process 57 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-22 20:12:57,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-22 20:12:57,302 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-22 20:12:57,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,329 INFO L229 MonitoredProcess]: Starting monitored process 58 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-22 20:12:57,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-22 20:12:57,331 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-22 20:12:57,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,337 INFO L203 nArgumentSynthesizer]: 5 stem disjuncts [2021-12-22 20:12:57,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,347 INFO L401 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2021-12-22 20:12:57,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,372 INFO L229 MonitoredProcess]: Starting monitored process 59 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-22 20:12:57,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-22 20:12:57,374 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-22 20:12:57,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,380 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-22 20:12:57,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,393 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-22 20:12:57,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,419 INFO L229 MonitoredProcess]: Starting monitored process 60 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-22 20:12:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-22 20:12:57,421 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-22 20:12:57,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:12:57,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,462 INFO L229 MonitoredProcess]: Starting monitored process 61 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-22 20:12:57,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-22 20:12:57,464 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-22 20:12:57,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:12:57,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:12:57,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:12:57,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:12:57,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:12:57,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:12:57,490 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:12:57,506 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-12-22 20:12:57,506 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-12-22 20:12:57,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:12:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:57,507 INFO L229 MonitoredProcess]: Starting monitored process 62 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-22 20:12:57,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-22 20:12:57,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:12:57,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 20:12:57,531 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:12:57,531 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-22 20:12:57,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:57,677 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2021-12-22 20:12:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:57,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 20:12:57,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:57,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 20:12:57,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:57,821 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-22 20:12:57,821 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-22 20:12:57,822 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-22 20:12:57,911 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-22 20:12:57,911 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-22 20:12:57,912 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-22 20:12:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2021-12-22 20:12:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2021-12-22 20:12:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2021-12-22 20:12:57,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:57,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2021-12-22 20:12:57,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:12:57,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2021-12-22 20:12:57,914 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2021-12-22 20:12:57,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2021-12-22 20:12:57,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-22 20:12:57,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-22 20:12:57,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2021-12-22 20:12:57,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:57,916 INFO L681 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2021-12-22 20:12:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2021-12-22 20:12:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2021-12-22 20:12:57,932 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-22 20:12:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2021-12-22 20:12:57,932 INFO L704 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2021-12-22 20:12:57,932 INFO L587 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2021-12-22 20:12:57,932 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-22 20:12:57,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2021-12-22 20:12:57,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-22 20:12:57,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:57,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:57,934 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-22 20:12:57,934 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:12:57,934 INFO L791 eck$LassoCheckResult]: Stem: 2301#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); 2276#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); 2272#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2273#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; 2285#L65 assume parse_expression_list_#t~switch5#1; 2335#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; 2334#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; 2333#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; 2332#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); 2331#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2330#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2329#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2328#L69-1 assume !parse_expression_list_#t~short15#1; 2327#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; 2326#L69-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 2325#L70 assume !parse_expression_list_#t~short18#1; 2324#L70-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 2323#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; 2322#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; 2321#L14 assume !(0 == __VERIFIER_assert_~cond#1); 2320#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); 2319#L71 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 2318#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2317#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); 2316#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2315#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; 2313#L65 assume parse_expression_list_#t~switch5#1; 2282#L66-5 [2021-12-22 20:12:57,934 INFO L793 eck$LassoCheckResult]: Loop: 2282#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; 2312#L66-1 assume parse_expression_list_#t~short8#1; 2281#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; 2282#L66-5 [2021-12-22 20:12:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2021-12-22 20:12:57,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:57,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763949733] [2021-12-22 20:12:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:57,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:57,971 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-22 20:12:57,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:57,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763949733] [2021-12-22 20:12:57,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763949733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:57,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:12:57,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:12:57,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89594316] [2021-12-22 20:12:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:57,972 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:12:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2021-12-22 20:12:57,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:57,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726958519] [2021-12-22 20:12:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:57,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:57,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:57,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:58,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:12:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:12:58,015 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-22 20:12:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:58,069 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2021-12-22 20:12:58,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 20:12:58,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 162 transitions. [2021-12-22 20:12:58,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:58,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 108 states and 147 transitions. [2021-12-22 20:12:58,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-22 20:12:58,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-22 20:12:58,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 147 transitions. [2021-12-22 20:12:58,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:58,072 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 147 transitions. [2021-12-22 20:12:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 147 transitions. [2021-12-22 20:12:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2021-12-22 20:12:58,073 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-22 20:12:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2021-12-22 20:12:58,074 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2021-12-22 20:12:58,074 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2021-12-22 20:12:58,074 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-22 20:12:58,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2021-12-22 20:12:58,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:58,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:58,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:58,075 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-22 20:12:58,075 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:12:58,075 INFO L791 eck$LassoCheckResult]: Stem: 2550#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); 2526#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); 2522#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2523#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; 2534#L65 assume !parse_expression_list_#t~switch5#1; 2553#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2544#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); 2545#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2535#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; 2547#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;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; 2600#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; 2596#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); 2593#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; 2539#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2540#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2556#L69-1 assume !parse_expression_list_#t~short15#1; 2557#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; 2567#L69-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 2566#L70 assume !parse_expression_list_#t~short18#1; 2565#L70-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 2541#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; 2542#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; 2554#L14 assume !(0 == __VERIFIER_assert_~cond#1); 2543#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); 2524#L71 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 2525#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2582#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); 2574#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2572#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; 2569#L65 assume parse_expression_list_#t~switch5#1; 2532#L66-5 [2021-12-22 20:12:58,076 INFO L793 eck$LassoCheckResult]: Loop: 2532#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; 2546#L66-1 assume parse_expression_list_#t~short8#1; 2531#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; 2532#L66-5 [2021-12-22 20:12:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1171373033, now seen corresponding path program 1 times [2021-12-22 20:12:58,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:58,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576141933] [2021-12-22 20:12:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:58,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:12:58,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:58,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576141933] [2021-12-22 20:12:58,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576141933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:12:58,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107493179] [2021-12-22 20:12:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:58,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:12:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:58,123 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:12:58,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-12-22 20:12:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:58,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 20:12:58,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 20:12:58,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 20:12:58,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107493179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:12:58,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 20:12:58,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-22 20:12:58,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679112878] [2021-12-22 20:12:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:12:58,284 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:12:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2021-12-22 20:12:58,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:58,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842615617] [2021-12-22 20:12:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:58,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:58,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:58,289 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:58,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:58,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 20:12:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-22 20:12:58,324 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-22 20:12:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:58,406 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2021-12-22 20:12:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 20:12:58,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 193 transitions. [2021-12-22 20:12:58,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:58,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 123 states and 163 transitions. [2021-12-22 20:12:58,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-22 20:12:58,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-22 20:12:58,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 163 transitions. [2021-12-22 20:12:58,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:12:58,409 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 163 transitions. [2021-12-22 20:12:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 163 transitions. [2021-12-22 20:12:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2021-12-22 20:12:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.34375) internal successors, (129), 95 states have internal predecessors, (129), 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-22 20:12:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2021-12-22 20:12:58,410 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2021-12-22 20:12:58,410 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2021-12-22 20:12:58,411 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-22 20:12:58,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2021-12-22 20:12:58,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:12:58,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:12:58,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:12:58,412 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-22 20:12:58,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:12:58,412 INFO L791 eck$LassoCheckResult]: Stem: 2894#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); 2868#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); 2864#L61 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2865#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; 2877#L65 assume !parse_expression_list_#t~switch5#1; 2897#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2898#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); 2908#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2878#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; 2879#L65 assume parse_expression_list_#t~switch5#1; 2949#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; 2948#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; 2947#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; 2946#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); 2945#L67 assume !(34 == parse_expression_list_#t~mem10#1);havoc parse_expression_list_#t~mem10#1; 2944#L67-2 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2943#L69-8 parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; 2925#L69-1 assume !parse_expression_list_#t~short15#1; 2918#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; 2917#L69-9 parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; 2916#L70 assume !parse_expression_list_#t~short18#1; 2915#L70-2 assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; 2884#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; 2885#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; 2899#L14 assume !(0 == __VERIFIER_assert_~cond#1); 2886#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); 2866#L71 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 2867#L64 havoc parse_expression_list_#t~mem4#1;havoc parse_expression_list_#t~switch5#1; 2914#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); 2913#L62-2 assume !!(0 != parse_expression_list_#t~mem2#1);havoc parse_expression_list_#t~mem2#1; 2912#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; 2910#L65 assume parse_expression_list_#t~switch5#1; 2874#L66-5 [2021-12-22 20:12:58,412 INFO L793 eck$LassoCheckResult]: Loop: 2874#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; 2889#L66-1 assume parse_expression_list_#t~short8#1; 2873#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; 2874#L66-5 [2021-12-22 20:12:58,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2021-12-22 20:12:58,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:58,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883895315] [2021-12-22 20:12:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:58,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:58,482 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-22 20:12:58,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:12:58,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883895315] [2021-12-22 20:12:58,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883895315] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:12:58,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836751163] [2021-12-22 20:12:58,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:58,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:12:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:12:58,500 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:12:58,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-12-22 20:12:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:12:58,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-22 20:12:58,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:12:58,592 INFO L387 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-22 20:12:58,716 INFO L387 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-22 20:12:58,736 INFO L387 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-22 20:12:58,740 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-22 20:12:58,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:12:58,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_174 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_parse_expression_list_~#str2~0#1.base| v_ArrVal_174) |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-22 20:12:58,909 INFO L387 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-22 20:12:58,929 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-22 20:12:58,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836751163] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:12:58,929 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 20:12:58,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-12-22 20:12:58,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980509939] [2021-12-22 20:12:58,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 20:12:58,930 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:12:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:12:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2021-12-22 20:12:58,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:12:58,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603464583] [2021-12-22 20:12:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:12:58,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:12:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:58,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:12:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:12:58,936 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:12:58,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:12:58,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 20:12:58,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2021-12-22 20:12:58,975 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. cyclomatic complexity: 40 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-22 20:12:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:12:59,081 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2021-12-22 20:12:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 20:12:59,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 92 transitions. [2021-12-22 20:12:59,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-22 20:12:59,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 0 states and 0 transitions. [2021-12-22 20:12:59,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-22 20:12:59,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-22 20:12:59,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-22 20:12:59,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:12:59,083 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:12:59,083 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:12:59,084 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:12:59,084 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-22 20:12:59,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-22 20:12:59,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-22 20:12:59,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-22 20:12:59,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.12 08:12:59 BoogieIcfgContainer [2021-12-22 20:12:59,090 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-22 20:12:59,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 20:12:59,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 20:12:59,091 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 20:12:59,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:12:48" (3/4) ... [2021-12-22 20:12:59,093 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 20:12:59,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 20:12:59,094 INFO L158 Benchmark]: Toolchain (without parser) took 11396.29ms. Allocated memory was 83.9MB in the beginning and 163.6MB in the end (delta: 79.7MB). Free memory was 53.5MB in the beginning and 84.5MB in the end (delta: -31.0MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2021-12-22 20:12:59,094 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:12:59,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.01ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 53.2MB in the beginning and 88.2MB in the end (delta: -35.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 20:12:59,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.79ms. Allocated memory is still 113.2MB. Free memory was 88.2MB in the beginning and 86.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:12:59,095 INFO L158 Benchmark]: Boogie Preprocessor took 44.15ms. Allocated memory is still 113.2MB. Free memory was 86.5MB in the beginning and 84.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:12:59,095 INFO L158 Benchmark]: RCFGBuilder took 359.60ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 71.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-22 20:12:59,095 INFO L158 Benchmark]: BuchiAutomizer took 10662.90ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 71.8MB in the beginning and 84.5MB in the end (delta: -12.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2021-12-22 20:12:59,095 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 163.6MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:12:59,096 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 83.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.01ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 53.2MB in the beginning and 88.2MB in the end (delta: -35.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.79ms. Allocated memory is still 113.2MB. Free memory was 88.2MB in the beginning and 86.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.15ms. Allocated memory is still 113.2MB. Free memory was 86.5MB in the beginning and 84.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 359.60ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 71.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 10662.90ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 71.8MB in the beginning and 84.5MB in the end (delta: -12.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 163.6MB. Free memory is still 84.5MB. 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 11 terminating modules (8 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. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 9.2s. 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 10. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 264 StatesRemovedByMinimization, 9 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, 546 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 27 IncrementalHoareTripleChecker+Unchecked, 717 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 670 IncrementalHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 347 mSDtfsCounter, 670 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU4 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax100 hnf100 lsp92 ukn84 mio100 lsp32 div100 bol100 ite100 ukn100 eq194 hnf89 smp100 dnf201 smp74 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-22 20:12:59,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:59,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2021-12-22 20:12:59,534 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-22 20:12:59,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE