/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:48:28,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:48:28,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:48:28,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:48:28,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:48:28,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:48:28,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:48:28,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:48:28,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:48:28,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:48:28,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:48:28,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:48:28,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:48:28,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:48:28,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:48:28,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:48:28,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:48:28,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:48:28,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:48:28,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:48:28,333 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:48:28,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:48:28,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:48:28,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:48:28,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:48:28,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:48:28,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:48:28,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:48:28,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:48:28,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:48:28,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:48:28,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:48:28,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:48:28,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:48:28,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:48:28,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:48:28,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:48:28,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:48:28,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:48:28,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:48:28,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:48:28,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:48:28,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:48:28,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:48:28,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:48:28,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:48:28,422 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:48:28,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:48:28,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:48:28,425 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:48:28,425 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:48:28,425 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:48:28,426 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:48:28,427 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:48:28,427 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:48:28,427 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:48:28,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:48:28,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:48:28,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:48:28,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:48:28,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:48:28,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:48:28,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:48:28,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:48:28,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:48:28,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:48:28,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:48:28,430 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:48:28,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:48:28,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:48:28,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:48:28,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:48:28,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:48:28,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:48:28,433 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:48:28,434 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:48:28,435 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 [2022-07-22 12:48:28,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:48:28,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:48:28,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:48:28,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:48:28,901 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:48:28,902 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-07-22 12:48:28,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7837b8086/3146cb7f17db42cd9d9e661293c48d7c/FLAG264d15597 [2022-07-22 12:48:29,693 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:48:29,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-07-22 12:48:29,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7837b8086/3146cb7f17db42cd9d9e661293c48d7c/FLAG264d15597 [2022-07-22 12:48:30,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7837b8086/3146cb7f17db42cd9d9e661293c48d7c [2022-07-22 12:48:30,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:48:30,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:48:30,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:48:30,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:48:30,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:48:30,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef64479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30, skipping insertion in model container [2022-07-22 12:48:30,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:48:30,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:48:30,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-07-22 12:48:30,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:48:30,403 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:48:30,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-07-22 12:48:30,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:48:30,455 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:48:30,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30 WrapperNode [2022-07-22 12:48:30,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:48:30,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:48:30,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:48:30,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:48:30,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,519 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2022-07-22 12:48:30,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:48:30,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:48:30,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:48:30,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:48:30,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:48:30,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:48:30,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:48:30,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:48:30,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (1/1) ... [2022-07-22 12:48:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:30,629 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) [2022-07-22 12:48:30,644 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 [2022-07-22 12:48:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:48:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:48:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:48:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:48:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:48:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 12:48:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 12:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:48:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:48:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:48:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:48:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:48:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:48:30,707 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:48:30,813 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:48:30,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:48:31,358 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:48:31,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:48:31,521 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:48:31,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:48:31 BoogieIcfgContainer [2022-07-22 12:48:31,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:48:31,525 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:48:31,526 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:48:31,531 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:48:31,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:48:31,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:48:30" (1/3) ... [2022-07-22 12:48:31,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24bc34c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:48:31, skipping insertion in model container [2022-07-22 12:48:31,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:48:31,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:30" (2/3) ... [2022-07-22 12:48:31,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24bc34c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:48:31, skipping insertion in model container [2022-07-22 12:48:31,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:48:31,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:48:31" (3/3) ... [2022-07-22 12:48:31,536 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-07-22 12:48:31,642 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 12:48:31,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 173 transitions, 378 flow [2022-07-22 12:48:31,819 INFO L129 PetriNetUnfolder]: 12/165 cut-off events. [2022-07-22 12:48:31,820 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:48:31,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 165 events. 12/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-07-22 12:48:31,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 173 transitions, 378 flow [2022-07-22 12:48:31,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:31,847 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:48:31,861 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:31,865 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:31,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:31,930 INFO L129 PetriNetUnfolder]: 12/165 cut-off events. [2022-07-22 12:48:31,930 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:48:31,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 165 events. 12/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-07-22 12:48:31,936 INFO L116 LiptonReduction]: Number of co-enabled transitions 2280 [2022-07-22 12:48:39,490 INFO L131 LiptonReduction]: Checked pairs total: 3511 [2022-07-22 12:48:39,491 INFO L133 LiptonReduction]: Total number of compositions: 156 [2022-07-22 12:48:39,522 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:48:39,522 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:48:39,522 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:48:39,524 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:48:39,524 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:48:39,526 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:48:39,526 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:48:39,527 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:48:39,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:48:39,703 INFO L131 ngComponentsAnalysis]: Automaton has 225 accepting balls. 225 [2022-07-22 12:48:39,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:39,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:39,710 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:48:39,710 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:39,710 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:48:39,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 396 states, but on-demand construction may add more states [2022-07-22 12:48:39,769 INFO L131 ngComponentsAnalysis]: Automaton has 225 accepting balls. 225 [2022-07-22 12:48:39,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:39,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:39,770 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:48:39,770 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:39,776 INFO L748 eck$LassoCheckResult]: Stem: 173#[ULTIMATE.startENTRY]don't care [677] ULTIMATE.startENTRY-->L130-6: Formula: (let ((.cse2 (store |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55| 1))) (let ((.cse0 (select |v_#memory_int_175| 1)) (.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57| 1))) (and (= (select |v_#valid_278| 1) 1) (= (select .cse0 1) 0) (not (= (ite (< 0 v_~N~0_71) 1 0) 0)) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t4~0#1.base_57|) (= 25 (select |v_#length_207| 2)) (= v_~A~0.base_88 0) (= (select |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= v_~b1~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= (select |v_#length_207| 1) 2) (= (store (store (store (store (store |v_#length_207| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|)) |v_#length_205|) (= v_~max~0_52 0) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_45| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_276|) (= v_~b2~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55|) 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57|) 0) (< 0 |v_#StackHeapBarrier_45|) (= v_~A~0.offset_88 0) (= v_~v_assert~0_32 0) (= v_~min~0_58 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select |v_#valid_278| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| v_~N~0_71) (= |v_#NULL.offset_8| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_45|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_56| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t3~0#1.base_55|) (= (select |v_#valid_278| 0) 0) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_45|, #valid=|v_#valid_278|, #memory_int=|v_#memory_int_175|, #length=|v_#length_207|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_22|, ~A~0.base=v_~A~0.base_88, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_29|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_37|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_21|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, #length=|v_#length_205|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_57|, ~b1~0=v_~b1~0_20, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_56|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, ~v_assert~0=v_~v_assert~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_45|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_37|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, ~min~0=v_~min~0_58, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_26|, ~b2~0=v_~b2~0_20, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_55|, ~max~0=v_~max~0_52, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_31|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ~N~0=v_~N~0_71, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_8|, ~A~0.offset=v_~A~0.offset_88, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_26|, #valid=|v_#valid_276|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_45|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_19|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, #length, ULTIMATE.start_main_~#t4~0#1.base, ~b1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~min~0, ULTIMATE.start_main_#t~nondet15#1, ~b2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ~max~0, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ~A~0.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 176#[L130-6]don't care [2022-07-22 12:48:39,777 INFO L750 eck$LassoCheckResult]: Loop: 176#[L130-6]don't care [659] L130-6-->L130-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|)) |v_#memory_int_163|) (<= 0 .cse0) (= (select |v_#valid_238| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4 .cse1) (select |v_#length_183| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_164|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_15|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_163|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 176#[L130-6]don't care [2022-07-22 12:48:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 708, now seen corresponding path program 1 times [2022-07-22 12:48:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:39,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632363346] [2022-07-22 12:48:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:40,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:40,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 690, now seen corresponding path program 1 times [2022-07-22 12:48:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:40,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830580057] [2022-07-22 12:48:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:40,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:40,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash 22607, now seen corresponding path program 1 times [2022-07-22 12:48:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:40,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819120269] [2022-07-22 12:48:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:40,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:40,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:41,665 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:41,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:41,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:41,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:41,666 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:41,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:41,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:41,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-inc.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:48:41,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:41,667 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:41,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:41,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:41,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:41,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:41,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:41,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:41,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:42,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:42,947 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:42,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:42,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:42,956 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) [2022-07-22 12:48:42,963 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 [2022-07-22 12:48:42,964 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 [2022-07-22 12:48:42,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:42,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:42,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:42,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:42,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:42,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:42,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:42,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,035 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 [2022-07-22 12:48:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,040 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) [2022-07-22 12:48:43,051 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 [2022-07-22 12:48:43,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,072 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 [2022-07-22 12:48:43,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,117 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 [2022-07-22 12:48:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,119 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) [2022-07-22 12:48:43,125 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 [2022-07-22 12:48:43,125 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 [2022-07-22 12:48:43,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:43,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:43,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:43,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,167 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 [2022-07-22 12:48:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,168 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) [2022-07-22 12:48:43,170 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 [2022-07-22 12:48:43,171 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 [2022-07-22 12:48:43,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:43,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:43,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:43,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,213 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 [2022-07-22 12:48:43,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,215 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) [2022-07-22 12:48:43,216 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 [2022-07-22 12:48:43,216 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 [2022-07-22 12:48:43,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,288 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 [2022-07-22 12:48:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,289 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) [2022-07-22 12:48:43,294 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 [2022-07-22 12:48:43,294 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 [2022-07-22 12:48:43,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:43,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:43,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:43,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,353 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 [2022-07-22 12:48:43,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,355 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) [2022-07-22 12:48:43,356 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 [2022-07-22 12:48:43,358 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 [2022-07-22 12:48:43,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,439 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 [2022-07-22 12:48:43,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,441 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) [2022-07-22 12:48:43,447 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 [2022-07-22 12:48:43,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,463 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 [2022-07-22 12:48:43,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,512 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 [2022-07-22 12:48:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,514 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) [2022-07-22 12:48:43,520 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 [2022-07-22 12:48:43,520 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 [2022-07-22 12:48:43,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,588 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) [2022-07-22 12:48:43,589 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 [2022-07-22 12:48:43,590 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 [2022-07-22 12:48:43,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,625 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 [2022-07-22 12:48:43,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,626 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) [2022-07-22 12:48:43,627 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 [2022-07-22 12:48:43,630 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 [2022-07-22 12:48:43,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,696 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) [2022-07-22 12:48:43,704 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 [2022-07-22 12:48:43,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,720 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 [2022-07-22 12:48:43,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,767 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 [2022-07-22 12:48:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,769 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) [2022-07-22 12:48:43,774 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 [2022-07-22 12:48:43,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,791 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 [2022-07-22 12:48:43,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,834 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 [2022-07-22 12:48:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,836 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) [2022-07-22 12:48:43,842 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 [2022-07-22 12:48:43,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,860 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 [2022-07-22 12:48:43,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:43,912 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 [2022-07-22 12:48:43,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:43,915 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) [2022-07-22 12:48:43,929 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 [2022-07-22 12:48:43,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:43,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:43,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:43,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:43,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:43,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:43,957 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 [2022-07-22 12:48:43,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:44,013 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:48:44,013 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-22 12:48:44,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:44,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:44,033 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) [2022-07-22 12:48:44,068 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 [2022-07-22 12:48:44,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:44,091 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:48:44,092 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:44,092 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:48:44,147 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 [2022-07-22 12:48:44,300 INFO L257 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2022-07-22 12:48:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:44,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:44,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:44,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:44,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:44,413 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:48:44,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 396 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-22 12:48:44,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 396 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 398 states and 1476 transitions. Complement of second has 3 states. [2022-07-22 12:48:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:48:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-22 12:48:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:48:44,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:48:44,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:44,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:48:44,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:44,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:48:44,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:44,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 1476 transitions. [2022-07-22 12:48:44,518 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:44,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 378 states and 1420 transitions. [2022-07-22 12:48:44,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2022-07-22 12:48:44,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2022-07-22 12:48:44,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 1420 transitions. [2022-07-22 12:48:44,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:44,563 INFO L220 hiAutomatonCegarLoop]: Abstraction has 378 states and 1420 transitions. [2022-07-22 12:48:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 1420 transitions. [2022-07-22 12:48:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-07-22 12:48:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 378 states have (on average 3.7566137566137567) internal successors, (1420), 377 states have internal predecessors, (1420), 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) [2022-07-22 12:48:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1420 transitions. [2022-07-22 12:48:44,670 INFO L242 hiAutomatonCegarLoop]: Abstraction has 378 states and 1420 transitions. [2022-07-22 12:48:44,670 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 1420 transitions. [2022-07-22 12:48:44,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:48:44,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 1420 transitions. [2022-07-22 12:48:44,677 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:44,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:44,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:44,679 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:48:44,679 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:44,680 INFO L748 eck$LassoCheckResult]: Stem: 2250#[ULTIMATE.startENTRY]don't care [677] ULTIMATE.startENTRY-->L130-6: Formula: (let ((.cse2 (store |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55| 1))) (let ((.cse0 (select |v_#memory_int_175| 1)) (.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57| 1))) (and (= (select |v_#valid_278| 1) 1) (= (select .cse0 1) 0) (not (= (ite (< 0 v_~N~0_71) 1 0) 0)) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t4~0#1.base_57|) (= 25 (select |v_#length_207| 2)) (= v_~A~0.base_88 0) (= (select |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= v_~b1~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= (select |v_#length_207| 1) 2) (= (store (store (store (store (store |v_#length_207| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|)) |v_#length_205|) (= v_~max~0_52 0) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_45| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_276|) (= v_~b2~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55|) 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57|) 0) (< 0 |v_#StackHeapBarrier_45|) (= v_~A~0.offset_88 0) (= v_~v_assert~0_32 0) (= v_~min~0_58 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select |v_#valid_278| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| v_~N~0_71) (= |v_#NULL.offset_8| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_45|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_56| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t3~0#1.base_55|) (= (select |v_#valid_278| 0) 0) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_45|, #valid=|v_#valid_278|, #memory_int=|v_#memory_int_175|, #length=|v_#length_207|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_22|, ~A~0.base=v_~A~0.base_88, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_29|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_37|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_21|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, #length=|v_#length_205|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_57|, ~b1~0=v_~b1~0_20, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_56|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, ~v_assert~0=v_~v_assert~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_45|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_37|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, ~min~0=v_~min~0_58, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_26|, ~b2~0=v_~b2~0_20, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_55|, ~max~0=v_~max~0_52, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_31|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ~N~0=v_~N~0_71, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_8|, ~A~0.offset=v_~A~0.offset_88, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_26|, #valid=|v_#valid_276|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_45|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_19|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, #length, ULTIMATE.start_main_~#t4~0#1.base, ~b1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~min~0, ULTIMATE.start_main_#t~nondet15#1, ~b2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ~max~0, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ~A~0.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2246#[L130-6]don't care [663] L130-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~A~0.base_82) (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= (select |v_#valid_242| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_62|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~A~0.offset_82) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_187| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_167|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_242|, #memory_int=|v_#memory_int_168|, #length=|v_#length_187|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_25|, ~A~0.base=v_~A~0.base_82, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, ~A~0.offset=v_~A~0.offset_82, #pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_25|, #valid=|v_#valid_242|, #memory_int=|v_#memory_int_167|, #length=|v_#length_187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1] 2232#[L110-3]don't care [508] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_4|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~ite5] 2090#[thread1ENTRY, L110-4]don't care [469] thread1ENTRY-->L50: Formula: (and (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) (<= (+ v_~A~0.offset_20 4) (select |v_#length_39| v_~A~0.base_20)) (<= 0 v_~A~0.offset_20) (= (select |v_#valid_48| v_~A~0.base_20) 1)) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, #length=|v_#length_39|, ~A~0.offset=v_~A~0.offset_20, #valid=|v_#valid_48|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_37|, #length=|v_#length_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, ~min~0] 2084#[L50, L110-4]don't care [587] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_21 0) (= v_~b1~0_6 1)) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, ~b1~0] 1764#[L56-4, L110-4]don't care [2022-07-22 12:48:44,680 INFO L750 eck$LassoCheckResult]: Loop: 1764#[L56-4, L110-4]don't care [632] L56-4-->L56-4: Formula: (let ((.cse3 (* v_thread1Thread1of1ForFork0_~i~0_28 4))) (let ((.cse2 (+ .cse3 v_~A~0.offset_70))) (and (let ((.cse1 (select (select |v_#memory_int_135| v_~A~0.base_70) .cse2))) (let ((.cse0 (< v_~min~0_47 .cse1))) (or (and (= |v_thread1_#t~mem4_30| |v_thread1Thread1of1ForFork0_#t~mem4_14|) (= v_~min~0_47 v_~min~0_46) .cse0) (and (not .cse0) (= .cse1 |v_thread1_#t~mem4_30|) (= v_~min~0_46 |v_thread1_#t~mem4_30|))))) (< v_thread1Thread1of1ForFork0_~i~0_28 v_~N~0_41) (<= 0 .cse2) (= (select |v_#valid_176| v_~A~0.base_70) 1) (<= (+ .cse3 v_~A~0.offset_70 4) (select |v_#length_145| v_~A~0.base_70)) (= (+ v_thread1Thread1of1ForFork0_~i~0_28 1) v_thread1Thread1of1ForFork0_~i~0_27)))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_14|, ~min~0=v_~min~0_47, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_28, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41} OutVars{~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_9|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, ~min~0=v_~min~0_46, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_27, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_9|} AuxVars[|v_thread1_#t~mem4_30|] AssignedVars[thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, ~min~0, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#t~ite5] 1764#[L56-4, L110-4]don't care [2022-07-22 12:48:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 674107615, now seen corresponding path program 1 times [2022-07-22 12:48:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:44,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911303961] [2022-07-22 12:48:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:48:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:48:44,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911303961] [2022-07-22 12:48:44,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911303961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:48:44,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:48:44,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:48:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029610185] [2022-07-22 12:48:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:48:44,836 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:48:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2022-07-22 12:48:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379255919] [2022-07-22 12:48:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:44,838 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 [2022-07-22 12:48:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:44,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:44,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:48:44,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:48:44,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:48:44,964 INFO L87 Difference]: Start difference. First operand 378 states and 1420 transitions. cyclomatic complexity: 1267 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-07-22 12:48:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:48:45,037 INFO L93 Difference]: Finished difference Result 378 states and 1419 transitions. [2022-07-22 12:48:45,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 1419 transitions. [2022-07-22 12:48:45,048 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:45,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 378 states and 1419 transitions. [2022-07-22 12:48:45,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2022-07-22 12:48:45,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2022-07-22 12:48:45,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 1419 transitions. [2022-07-22 12:48:45,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:45,060 INFO L220 hiAutomatonCegarLoop]: Abstraction has 378 states and 1419 transitions. [2022-07-22 12:48:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 1419 transitions. [2022-07-22 12:48:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-07-22 12:48:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 378 states have (on average 3.753968253968254) internal successors, (1419), 377 states have internal predecessors, (1419), 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) [2022-07-22 12:48:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1419 transitions. [2022-07-22 12:48:45,081 INFO L242 hiAutomatonCegarLoop]: Abstraction has 378 states and 1419 transitions. [2022-07-22 12:48:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:48:45,082 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 1419 transitions. [2022-07-22 12:48:45,082 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:48:45,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 1419 transitions. [2022-07-22 12:48:45,090 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:45,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:45,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:45,091 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:48:45,091 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:45,092 INFO L748 eck$LassoCheckResult]: Stem: 3390#[ULTIMATE.startENTRY]don't care [677] ULTIMATE.startENTRY-->L130-6: Formula: (let ((.cse2 (store |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55| 1))) (let ((.cse0 (select |v_#memory_int_175| 1)) (.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57| 1))) (and (= (select |v_#valid_278| 1) 1) (= (select .cse0 1) 0) (not (= (ite (< 0 v_~N~0_71) 1 0) 0)) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t4~0#1.base_57|) (= 25 (select |v_#length_207| 2)) (= v_~A~0.base_88 0) (= (select |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= v_~b1~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= (select |v_#length_207| 1) 2) (= (store (store (store (store (store |v_#length_207| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|)) |v_#length_205|) (= v_~max~0_52 0) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_45| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_276|) (= v_~b2~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55|) 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57|) 0) (< 0 |v_#StackHeapBarrier_45|) (= v_~A~0.offset_88 0) (= v_~v_assert~0_32 0) (= v_~min~0_58 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select |v_#valid_278| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| v_~N~0_71) (= |v_#NULL.offset_8| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_45|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_56| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t3~0#1.base_55|) (= (select |v_#valid_278| 0) 0) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_45|, #valid=|v_#valid_278|, #memory_int=|v_#memory_int_175|, #length=|v_#length_207|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_22|, ~A~0.base=v_~A~0.base_88, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_29|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_37|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_21|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, #length=|v_#length_205|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_57|, ~b1~0=v_~b1~0_20, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_56|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, ~v_assert~0=v_~v_assert~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_45|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_37|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, ~min~0=v_~min~0_58, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_26|, ~b2~0=v_~b2~0_20, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_55|, ~max~0=v_~max~0_52, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_31|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ~N~0=v_~N~0_71, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_8|, ~A~0.offset=v_~A~0.offset_88, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_26|, #valid=|v_#valid_276|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_45|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_19|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, #length, ULTIMATE.start_main_~#t4~0#1.base, ~b1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~min~0, ULTIMATE.start_main_#t~nondet15#1, ~b2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ~max~0, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ~A~0.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3386#[L130-6]don't care [659] L130-6-->L130-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|)) |v_#memory_int_163|) (<= 0 .cse0) (= (select |v_#valid_238| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4 .cse1) (select |v_#length_183| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_164|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_15|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_163|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 3388#[L130-6]don't care [663] L130-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~A~0.base_82) (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= (select |v_#valid_242| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_62|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~A~0.offset_82) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_187| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_167|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_242|, #memory_int=|v_#memory_int_168|, #length=|v_#length_187|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_25|, ~A~0.base=v_~A~0.base_82, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, ~A~0.offset=v_~A~0.offset_82, #pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_25|, #valid=|v_#valid_242|, #memory_int=|v_#memory_int_167|, #length=|v_#length_187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1] 3372#[L110-3]don't care [508] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_4|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~ite5] 3230#[thread1ENTRY, L110-4]don't care [469] thread1ENTRY-->L50: Formula: (and (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) (<= (+ v_~A~0.offset_20 4) (select |v_#length_39| v_~A~0.base_20)) (<= 0 v_~A~0.offset_20) (= (select |v_#valid_48| v_~A~0.base_20) 1)) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, #length=|v_#length_39|, ~A~0.offset=v_~A~0.offset_20, #valid=|v_#valid_48|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_37|, #length=|v_#length_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, ~min~0] 3226#[L50, L110-4]don't care [587] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_21 0) (= v_~b1~0_6 1)) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, ~b1~0] 2904#[L56-4, L110-4]don't care [2022-07-22 12:48:45,092 INFO L750 eck$LassoCheckResult]: Loop: 2904#[L56-4, L110-4]don't care [632] L56-4-->L56-4: Formula: (let ((.cse3 (* v_thread1Thread1of1ForFork0_~i~0_28 4))) (let ((.cse2 (+ .cse3 v_~A~0.offset_70))) (and (let ((.cse1 (select (select |v_#memory_int_135| v_~A~0.base_70) .cse2))) (let ((.cse0 (< v_~min~0_47 .cse1))) (or (and (= |v_thread1_#t~mem4_30| |v_thread1Thread1of1ForFork0_#t~mem4_14|) (= v_~min~0_47 v_~min~0_46) .cse0) (and (not .cse0) (= .cse1 |v_thread1_#t~mem4_30|) (= v_~min~0_46 |v_thread1_#t~mem4_30|))))) (< v_thread1Thread1of1ForFork0_~i~0_28 v_~N~0_41) (<= 0 .cse2) (= (select |v_#valid_176| v_~A~0.base_70) 1) (<= (+ .cse3 v_~A~0.offset_70 4) (select |v_#length_145| v_~A~0.base_70)) (= (+ v_thread1Thread1of1ForFork0_~i~0_28 1) v_thread1Thread1of1ForFork0_~i~0_27)))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_14|, ~min~0=v_~min~0_47, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_28, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41} OutVars{~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_9|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, ~min~0=v_~min~0_46, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_27, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_9|} AuxVars[|v_thread1_#t~mem4_30|] AssignedVars[thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, ~min~0, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#t~ite5] 2904#[L56-4, L110-4]don't care [2022-07-22 12:48:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -576542486, now seen corresponding path program 1 times [2022-07-22 12:48:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564645948] [2022-07-22 12:48:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:45,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:45,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 2 times [2022-07-22 12:48:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:45,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880782198] [2022-07-22 12:48:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:45,258 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:45,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:45,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -692947250, now seen corresponding path program 1 times [2022-07-22 12:48:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:45,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138364790] [2022-07-22 12:48:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:45,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:45,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:47,758 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:47,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:47,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:47,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:47,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:47,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:47,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:47,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:47,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-inc.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:48:47,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:47,759 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:47,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:47,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:48,198 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:48:48,205 INFO L158 Benchmark]: Toolchain (without parser) took 18153.40ms. Allocated memory was 152.0MB in the beginning and 231.7MB in the end (delta: 79.7MB). Free memory was 126.2MB in the beginning and 168.7MB in the end (delta: -42.4MB). Peak memory consumption was 134.2MB. Max. memory is 8.0GB. [2022-07-22 12:48:48,206 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 152.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:48:48,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.20ms. Allocated memory is still 152.0MB. Free memory was 126.0MB in the beginning and 114.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:48:48,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.12ms. Allocated memory is still 152.0MB. Free memory was 114.7MB in the beginning and 112.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:48:48,218 INFO L158 Benchmark]: Boogie Preprocessor took 43.58ms. Allocated memory is still 152.0MB. Free memory was 112.7MB in the beginning and 111.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:48:48,219 INFO L158 Benchmark]: RCFGBuilder took 959.92ms. Allocated memory is still 152.0MB. Free memory was 110.9MB in the beginning and 123.3MB in the end (delta: -12.4MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2022-07-22 12:48:48,219 INFO L158 Benchmark]: BuchiAutomizer took 16677.99ms. Allocated memory was 152.0MB in the beginning and 231.7MB in the end (delta: 79.7MB). Free memory was 123.3MB in the beginning and 168.7MB in the end (delta: -45.3MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. [2022-07-22 12:48:48,227 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.23ms. Allocated memory is still 152.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 396.20ms. Allocated memory is still 152.0MB. Free memory was 126.0MB in the beginning and 114.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.12ms. Allocated memory is still 152.0MB. Free memory was 114.7MB in the beginning and 112.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.58ms. Allocated memory is still 152.0MB. Free memory was 112.7MB in the beginning and 111.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 959.92ms. Allocated memory is still 152.0MB. Free memory was 110.9MB in the beginning and 123.3MB in the end (delta: -12.4MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 16677.99ms. Allocated memory was 152.0MB in the beginning and 231.7MB in the end (delta: 79.7MB). Free memory was 123.3MB in the beginning and 168.7MB in the end (delta: -45.3MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 166 PlacesBefore, 40 PlacesAfterwards, 165 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 7 FixpointIterations, 89 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 156 TotalNumberOfCompositions, 3511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2544, positive: 2457, positive conditional: 0, positive unconditional: 2457, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2544, positive: 1276, positive conditional: 0, positive unconditional: 1276, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:48:48,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...