/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:54:34,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:54:34,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:54:34,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:54:34,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:54:34,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:54:34,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:54:34,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:54:34,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:54:34,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:54:34,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:54:34,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:54:34,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:54:34,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:54:34,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:54:34,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:54:34,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:54:34,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:54:34,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:54:34,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:54:34,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:54:34,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:54:34,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:54:34,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:54:34,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:54:34,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:54:34,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:54:34,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:54:34,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:54:34,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:54:34,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:54:34,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:54:34,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:54:34,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:54:34,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:54:34,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:54:34,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:54:34,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:54:34,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:54:34,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:54:34,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:54:34,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 05:54:34,421 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:54:34,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:54:34,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:54:34,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:54:34,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:54:34,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:54:34,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:54:34,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:54:34,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:54:34,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:54:34,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:54:34,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:54:34,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:54:34,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 05:54:34,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:54:34,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:54:34,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:54:34,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:54:34,744 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:54:34,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-12-13 05:54:35,775 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:54:36,043 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:54:36,043 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-12-13 05:54:36,057 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71724edf/a62fbc896ead4a17a9d89f88c1ac471d/FLAG21a28fde5 [2022-12-13 05:54:36,072 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71724edf/a62fbc896ead4a17a9d89f88c1ac471d [2022-12-13 05:54:36,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:54:36,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:54:36,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:54:36,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:54:36,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:54:36,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557dab93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36, skipping insertion in model container [2022-12-13 05:54:36,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:54:36,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:54:36,486 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-12-13 05:54:36,492 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-12-13 05:54:36,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:54:36,506 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:54:36,549 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-12-13 05:54:36,550 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-12-13 05:54:36,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:54:36,594 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:54:36,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36 WrapperNode [2022-12-13 05:54:36,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:54:36,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:54:36,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:54:36,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:54:36,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,650 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-13 05:54:36,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:54:36,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:54:36,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:54:36,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:54:36,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,670 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:54:36,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:54:36,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:54:36,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:54:36,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (1/1) ... [2022-12-13 05:54:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:54:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:36,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 05:54:36,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 05:54:36,723 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 05:54:36,723 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:54:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 05:54:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:54:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:54:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:54:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:54:36,725 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 05:54:36,892 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:54:36,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:54:37,159 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:54:37,165 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:54:37,165 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 05:54:37,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:54:37 BoogieIcfgContainer [2022-12-13 05:54:37,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:54:37,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:54:37,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:54:37,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:54:37,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:54:36" (1/3) ... [2022-12-13 05:54:37,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4859447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:54:37, skipping insertion in model container [2022-12-13 05:54:37,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:36" (2/3) ... [2022-12-13 05:54:37,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4859447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:54:37, skipping insertion in model container [2022-12-13 05:54:37,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:54:37" (3/3) ... [2022-12-13 05:54:37,173 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-13 05:54:37,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:54:37,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 05:54:37,185 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:54:37,283 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 05:54:37,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-13 05:54:37,389 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-13 05:54:37,389 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:54:37,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-13 05:54:37,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-13 05:54:37,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-13 05:54:37,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:37,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-13 05:54:37,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-13 05:54:37,463 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-13 05:54:37,463 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 05:54:37,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 13/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-13 05:54:37,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-13 05:54:37,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-13 05:54:45,832 INFO L241 LiptonReduction]: Total number of compositions: 167 [2022-12-13 05:54:45,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:54:45,847 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b5d2b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:54:45,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 05:54:45,849 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 05:54:45,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 05:54:45,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:45,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 05:54:45,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 880, now seen corresponding path program 1 times [2022-12-13 05:54:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:45,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902059707] [2022-12-13 05:54:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:45,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902059707] [2022-12-13 05:54:45,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902059707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:45,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:45,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 05:54:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456445200] [2022-12-13 05:54:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:45,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 05:54:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 05:54:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 05:54:45,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2022-12-13 05:54:45,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 173 flow. Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:54:45,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:45,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2022-12-13 05:54:45,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:46,380 INFO L130 PetriNetUnfolder]: 3558/5821 cut-off events. [2022-12-13 05:54:46,381 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 05:54:46,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11288 conditions, 5821 events. 3558/5821 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 33901 event pairs, 2900 based on Foata normal form. 0/3129 useless extension candidates. Maximal degree in co-relation 11124. Up to 5369 conditions per place. [2022-12-13 05:54:46,408 INFO L137 encePairwiseOnDemand]: 80/82 looper letters, 65 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2022-12-13 05:54:46,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 05:54:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 05:54:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-12-13 05:54:46,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2022-12-13 05:54:46,419 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 0 predicate places. [2022-12-13 05:54:46,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:46,460 INFO L89 Accepts]: Start accepts. Operand has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:46,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:46,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 05:54:46,524 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:46,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 05:54:46,525 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 299 flow [2022-12-13 05:54:46,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:54:46,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:46,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:46,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:54:46,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1562134785, now seen corresponding path program 1 times [2022-12-13 05:54:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:46,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961449762] [2022-12-13 05:54:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961449762] [2022-12-13 05:54:46,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961449762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:46,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:46,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 05:54:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628719339] [2022-12-13 05:54:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:54:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:54:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:54:46,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 80 [2022-12-13 05:54:46,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-12-13 05:54:46,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:46,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 80 [2022-12-13 05:54:46,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:47,005 INFO L130 PetriNetUnfolder]: 1015/1878 cut-off events. [2022-12-13 05:54:47,006 INFO L131 PetriNetUnfolder]: For 162/168 co-relation queries the response was YES. [2022-12-13 05:54:47,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 1878 events. 1015/1878 cut-off events. For 162/168 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10307 event pairs, 820 based on Foata normal form. 119/1166 useless extension candidates. Maximal degree in co-relation 5169. Up to 1725 conditions per place. [2022-12-13 05:54:47,011 INFO L137 encePairwiseOnDemand]: 76/80 looper letters, 38 selfloop transitions, 2 changer transitions 38/91 dead transitions. [2022-12-13 05:54:47,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 503 flow [2022-12-13 05:54:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:54:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:54:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-12-13 05:54:47,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 05:54:47,013 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2022-12-13 05:54:47,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 91 transitions, 503 flow [2022-12-13 05:54:47,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 276 flow [2022-12-13 05:54:47,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:47,023 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 276 flow [2022-12-13 05:54:47,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:47,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:47,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 276 flow [2022-12-13 05:54:47,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 276 flow [2022-12-13 05:54:47,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 05:54:47,211 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:54:47,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-13 05:54:47,212 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 274 flow [2022-12-13 05:54:47,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-12-13 05:54:47,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:47,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:47,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:54:47,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1524891937, now seen corresponding path program 1 times [2022-12-13 05:54:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:47,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284560339] [2022-12-13 05:54:47,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:47,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284560339] [2022-12-13 05:54:47,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284560339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:47,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:47,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:54:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888245434] [2022-12-13 05:54:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:47,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:54:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:54:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:54:47,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2022-12-13 05:54:47,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-12-13 05:54:47,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:47,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2022-12-13 05:54:47,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:47,355 INFO L130 PetriNetUnfolder]: 372/769 cut-off events. [2022-12-13 05:54:47,355 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-12-13 05:54:47,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 769 events. 372/769 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3310 event pairs, 163 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 2480. Up to 624 conditions per place. [2022-12-13 05:54:47,359 INFO L137 encePairwiseOnDemand]: 45/48 looper letters, 49 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2022-12-13 05:54:47,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 457 flow [2022-12-13 05:54:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:54:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:54:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 05:54:47,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 05:54:47,360 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -27 predicate places. [2022-12-13 05:54:47,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 65 transitions, 457 flow [2022-12-13 05:54:47,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 63 transitions, 449 flow [2022-12-13 05:54:47,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:47,366 INFO L89 Accepts]: Start accepts. Operand has 53 places, 63 transitions, 449 flow [2022-12-13 05:54:47,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:47,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:47,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 63 transitions, 449 flow [2022-12-13 05:54:47,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 63 transitions, 449 flow [2022-12-13 05:54:47,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 05:54:47,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:54:47,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 05:54:47,422 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 63 transitions, 449 flow [2022-12-13 05:54:47,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-12-13 05:54:47,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:47,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:47,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:54:47,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1777852052, now seen corresponding path program 1 times [2022-12-13 05:54:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:47,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488752359] [2022-12-13 05:54:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:47,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488752359] [2022-12-13 05:54:47,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488752359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:54:47,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566898252] [2022-12-13 05:54:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:47,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:47,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:47,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:54:47,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 05:54:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:47,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 05:54:47,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:54:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:47,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:54:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:47,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566898252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:54:47,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:54:47,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 05:54:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307094277] [2022-12-13 05:54:47,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:54:47,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:54:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:54:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:54:47,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 05:54:47,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 63 transitions, 449 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-12-13 05:54:47,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:47,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 05:54:47,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:47,919 INFO L130 PetriNetUnfolder]: 487/1069 cut-off events. [2022-12-13 05:54:47,919 INFO L131 PetriNetUnfolder]: For 790/790 co-relation queries the response was YES. [2022-12-13 05:54:47,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 1069 events. 487/1069 cut-off events. For 790/790 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4309 event pairs, 109 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 4231. Up to 843 conditions per place. [2022-12-13 05:54:47,925 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 75 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2022-12-13 05:54:47,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 05:54:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 05:54:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-13 05:54:47,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2022-12-13 05:54:47,933 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -23 predicate places. [2022-12-13 05:54:47,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:47,950 INFO L89 Accepts]: Start accepts. Operand has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:47,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:47,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 05:54:47,960 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:47,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 05:54:47,961 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 93 transitions, 860 flow [2022-12-13 05:54:47,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-12-13 05:54:47,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:47,962 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:47,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 05:54:48,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:48,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1700051833, now seen corresponding path program 1 times [2022-12-13 05:54:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:48,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062942674] [2022-12-13 05:54:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 05:54:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:48,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062942674] [2022-12-13 05:54:48,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062942674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:48,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:48,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:54:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219285983] [2022-12-13 05:54:48,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:48,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:54:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:54:48,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:54:48,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2022-12-13 05:54:48,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 93 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:54:48,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:48,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2022-12-13 05:54:48,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:48,365 INFO L130 PetriNetUnfolder]: 264/674 cut-off events. [2022-12-13 05:54:48,365 INFO L131 PetriNetUnfolder]: For 930/930 co-relation queries the response was YES. [2022-12-13 05:54:48,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 674 events. 264/674 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2516 event pairs, 0 based on Foata normal form. 87/635 useless extension candidates. Maximal degree in co-relation 3095. Up to 531 conditions per place. [2022-12-13 05:54:48,368 INFO L137 encePairwiseOnDemand]: 41/47 looper letters, 81 selfloop transitions, 5 changer transitions 2/98 dead transitions. [2022-12-13 05:54:48,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 1093 flow [2022-12-13 05:54:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:54:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:54:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 05:54:48,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2022-12-13 05:54:48,370 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -21 predicate places. [2022-12-13 05:54:48,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 98 transitions, 1093 flow [2022-12-13 05:54:48,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 96 transitions, 1079 flow [2022-12-13 05:54:48,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:48,375 INFO L89 Accepts]: Start accepts. Operand has 58 places, 96 transitions, 1079 flow [2022-12-13 05:54:48,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:48,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:48,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 96 transitions, 1079 flow [2022-12-13 05:54:48,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 96 transitions, 1079 flow [2022-12-13 05:54:48,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-13 05:54:48,380 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:48,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 05:54:48,381 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 96 transitions, 1079 flow [2022-12-13 05:54:48,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:54:48,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:48,381 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:48,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:54:48,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash 399273241, now seen corresponding path program 1 times [2022-12-13 05:54:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:48,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357952697] [2022-12-13 05:54:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:48,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:48,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357952697] [2022-12-13 05:54:48,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357952697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:54:48,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184159501] [2022-12-13 05:54:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:48,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:48,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:48,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:54:48,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 05:54:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:48,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 05:54:48,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:54:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:48,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:54:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:48,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184159501] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:54:48,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:54:48,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 05:54:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185973212] [2022-12-13 05:54:48,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:54:48,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 05:54:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 05:54:48,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 05:54:48,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 05:54:48,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 96 transitions, 1079 flow. Second operand has 13 states, 13 states have (on average 16.0) internal successors, (208), 13 states have internal predecessors, (208), 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-12-13 05:54:48,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:48,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 05:54:48,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:49,065 INFO L130 PetriNetUnfolder]: 436/1202 cut-off events. [2022-12-13 05:54:49,065 INFO L131 PetriNetUnfolder]: For 2708/2708 co-relation queries the response was YES. [2022-12-13 05:54:49,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6644 conditions, 1202 events. 436/1202 cut-off events. For 2708/2708 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4573 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 6269. Up to 880 conditions per place. [2022-12-13 05:54:49,073 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 163 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2022-12-13 05:54:49,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:54:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:54:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2022-12-13 05:54:49,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 05:54:49,077 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -12 predicate places. [2022-12-13 05:54:49,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:49,091 INFO L89 Accepts]: Start accepts. Operand has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:49,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:49,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 05:54:49,112 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:49,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 05:54:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 186 transitions, 2545 flow [2022-12-13 05:54:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 13 states have internal predecessors, (208), 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-12-13 05:54:49,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:49,114 INFO L214 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:49,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 05:54:49,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 05:54:49,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1358244953, now seen corresponding path program 2 times [2022-12-13 05:54:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:49,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494650616] [2022-12-13 05:54:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:49,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494650616] [2022-12-13 05:54:49,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494650616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:54:49,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931569039] [2022-12-13 05:54:49,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:54:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:49,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:54:49,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 05:54:49,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:54:49,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:54:49,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 05:54:49,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:54:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:49,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:54:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:54:50,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931569039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:54:50,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:54:50,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-12-13 05:54:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534413083] [2022-12-13 05:54:50,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:54:50,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 05:54:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:50,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 05:54:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-12-13 05:54:50,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 05:54:50,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 186 transitions, 2545 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 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-12-13 05:54:50,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:50,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 05:54:50,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:50,609 INFO L130 PetriNetUnfolder]: 726/2092 cut-off events. [2022-12-13 05:54:50,609 INFO L131 PetriNetUnfolder]: For 6965/6965 co-relation queries the response was YES. [2022-12-13 05:54:50,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12664 conditions, 2092 events. 726/2092 cut-off events. For 6965/6965 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8064 event pairs, 0 based on Foata normal form. 0/1791 useless extension candidates. Maximal degree in co-relation 12238. Up to 1470 conditions per place. [2022-12-13 05:54:50,620 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 303 selfloop transitions, 22 changer transitions 0/336 dead transitions. [2022-12-13 05:54:50,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 05:54:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 05:54:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 499 transitions. [2022-12-13 05:54:50,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.515495867768595 [2022-12-13 05:54:50,623 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2022-12-13 05:54:50,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:50,650 INFO L89 Accepts]: Start accepts. Operand has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:50,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:50,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 1332 [2022-12-13 05:54:50,696 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:50,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 05:54:50,697 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 336 transitions, 5355 flow [2022-12-13 05:54:50,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 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-12-13 05:54:50,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:50,698 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:50,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 05:54:50,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:50,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1923415596, now seen corresponding path program 1 times [2022-12-13 05:54:50,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:50,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646265189] [2022-12-13 05:54:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:50,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 738 proven. 40 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2022-12-13 05:54:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:52,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646265189] [2022-12-13 05:54:52,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646265189] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:54:52,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273663093] [2022-12-13 05:54:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:52,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:52,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:54:52,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 05:54:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:52,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 05:54:52,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:54:52,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 05:54:53,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:54:53,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:54:53,056 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:54:53,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:54:53,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:54:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 688 proven. 65 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2022-12-13 05:54:53,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:54:53,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 Int) (v_ArrVal_990 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_990) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_992) .cse1) 20))))) is different from false [2022-12-13 05:54:53,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:54:53,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-12-13 05:54:53,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:54:53,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-12-13 05:54:53,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-12-13 05:54:53,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 05:54:53,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:54:53,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-12-13 05:54:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 676 proven. 65 refuted. 0 times theorem prover too weak. 597 trivial. 12 not checked. [2022-12-13 05:54:53,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273663093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:54:53,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:54:53,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:54:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921260717] [2022-12-13 05:54:53,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:54:53,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 05:54:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 05:54:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=273, Unknown=1, NotChecked=34, Total=380 [2022-12-13 05:54:53,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-13 05:54:53,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 336 transitions, 5355 flow. Second operand has 20 states, 20 states have (on average 9.65) internal successors, (193), 20 states have internal predecessors, (193), 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-12-13 05:54:53,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:53,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-13 05:54:53,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:54,659 INFO L130 PetriNetUnfolder]: 2100/4809 cut-off events. [2022-12-13 05:54:54,660 INFO L131 PetriNetUnfolder]: For 28732/28732 co-relation queries the response was YES. [2022-12-13 05:54:54,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35320 conditions, 4809 events. 2100/4809 cut-off events. For 28732/28732 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 21641 event pairs, 54 based on Foata normal form. 0/4130 useless extension candidates. Maximal degree in co-relation 34558. Up to 3570 conditions per place. [2022-12-13 05:54:54,687 INFO L137 encePairwiseOnDemand]: 35/44 looper letters, 626 selfloop transitions, 185 changer transitions 6/822 dead transitions. [2022-12-13 05:54:54,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 822 transitions, 14871 flow [2022-12-13 05:54:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:54:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:54:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2022-12-13 05:54:54,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33181818181818185 [2022-12-13 05:54:54,689 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 18 predicate places. [2022-12-13 05:54:54,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 822 transitions, 14871 flow [2022-12-13 05:54:54,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 816 transitions, 14847 flow [2022-12-13 05:54:54,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:54,771 INFO L89 Accepts]: Start accepts. Operand has 97 places, 816 transitions, 14847 flow [2022-12-13 05:54:54,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:54,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:54,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 816 transitions, 14847 flow [2022-12-13 05:54:54,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 816 transitions, 14847 flow [2022-12-13 05:54:54,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 994 [2022-12-13 05:54:54,910 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:54,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 05:54:54,912 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 816 transitions, 14847 flow [2022-12-13 05:54:54,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.65) internal successors, (193), 20 states have internal predecessors, (193), 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-12-13 05:54:54,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:54,912 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:54,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 05:54:55,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:55,120 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:54:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 973850625, now seen corresponding path program 1 times [2022-12-13 05:54:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:55,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306480095] [2022-12-13 05:54:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 327 proven. 10 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2022-12-13 05:54:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:57,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306480095] [2022-12-13 05:54:57,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306480095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:54:57,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225722735] [2022-12-13 05:54:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:57,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:54:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:57,047 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:54:57,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 05:54:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:57,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 05:54:57,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:54:57,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 05:54:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:54:57,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:54:57,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:54:57,677 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 05:54:57,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:54:57,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:54:57,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:54:57,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:54:57,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:54:57,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:54:57,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:54:57,859 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:54:57,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:54:57,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:54:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 786 proven. 51 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-12-13 05:54:57,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:54:57,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1400 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1398) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| 4) |c_~#queue~0.offset|) v_ArrVal_1400) .cse1)))))) is different from false [2022-12-13 05:54:57,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1400 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1398) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| 4) |c_~#queue~0.offset|) v_ArrVal_1400) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| (select .cse0 .cse1)))))) is different from false [2022-12-13 05:54:57,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1400 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1398) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| 4) |c_~#queue~0.offset|) v_ArrVal_1400) .cse1) 20))))) is different from false [2022-12-13 05:54:58,019 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1400 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1394) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1398) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| 4) |c_~#queue~0.offset|) v_ArrVal_1400) .cse1) 20))))) is different from false [2022-12-13 05:54:58,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| Int) (v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1400 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1392)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1394) .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1398) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| 4) |c_~#queue~0.offset|) v_ArrVal_1400) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_175| (select .cse0 .cse1)))))) is different from false [2022-12-13 05:54:58,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:54:58,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 149 [2022-12-13 05:54:58,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:54:58,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-12-13 05:54:58,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 275 [2022-12-13 05:54:58,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 259 [2022-12-13 05:54:58,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 05:54:58,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:54:58,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 107 [2022-12-13 05:54:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 734 proven. 46 refuted. 0 times theorem prover too weak. 458 trivial. 57 not checked. [2022-12-13 05:54:58,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225722735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:54:58,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:54:58,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 32 [2022-12-13 05:54:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142307710] [2022-12-13 05:54:58,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:54:58,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 05:54:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:58,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 05:54:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=574, Unknown=7, NotChecked=280, Total=1056 [2022-12-13 05:54:58,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2022-12-13 05:54:58,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 816 transitions, 14847 flow. Second operand has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 33 states have internal predecessors, (285), 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-12-13 05:54:58,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:58,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2022-12-13 05:54:58,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:55:02,167 INFO L130 PetriNetUnfolder]: 3658/8589 cut-off events. [2022-12-13 05:55:02,168 INFO L131 PetriNetUnfolder]: For 41689/41689 co-relation queries the response was YES. [2022-12-13 05:55:02,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75013 conditions, 8589 events. 3658/8589 cut-off events. For 41689/41689 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 48155 event pairs, 57 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 73284. Up to 6943 conditions per place. [2022-12-13 05:55:02,228 INFO L137 encePairwiseOnDemand]: 29/42 looper letters, 1575 selfloop transitions, 671 changer transitions 0/2251 dead transitions. [2022-12-13 05:55:02,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 2251 transitions, 45910 flow [2022-12-13 05:55:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 05:55:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 05:55:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 278 transitions. [2022-12-13 05:55:02,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36772486772486773 [2022-12-13 05:55:02,230 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 33 predicate places. [2022-12-13 05:55:02,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 2251 transitions, 45910 flow [2022-12-13 05:55:02,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 2251 transitions, 45910 flow [2022-12-13 05:55:02,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:55:02,504 INFO L89 Accepts]: Start accepts. Operand has 114 places, 2251 transitions, 45910 flow [2022-12-13 05:55:02,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:55:02,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:55:02,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 2251 transitions, 45910 flow [2022-12-13 05:55:02,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 2251 transitions, 45910 flow [2022-12-13 05:55:02,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 2234 [2022-12-13 05:55:02,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:02,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:02,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:02,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:02,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:02,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:02,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:02,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:03,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:03,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:03,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:55:03,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-13 05:55:03,029 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 2251 transitions, 45930 flow [2022-12-13 05:55:03,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 33 states have internal predecessors, (285), 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-12-13 05:55:03,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:55:03,029 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 13, 13, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:55:03,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 05:55:03,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:55:03,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:55:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:55:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1091016388, now seen corresponding path program 1 times [2022-12-13 05:55:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:55:03,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348276211] [2022-12-13 05:55:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:55:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 895 proven. 82 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-12-13 05:55:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:55:06,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348276211] [2022-12-13 05:55:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348276211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:55:06,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630420050] [2022-12-13 05:55:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:55:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:55:06,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:55:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 05:55:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:07,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-13 05:55:07,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:55:07,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 05:55:07,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:07,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:07,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:07,646 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 05:55:07,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:55:07,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:07,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:07,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:07,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:07,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:07,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:07,837 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 05:55:07,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:55:07,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:07,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:07,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:07,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:07,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:08,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:08,025 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 05:55:08,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:55:08,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:08,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:08,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:08,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:08,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:08,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:08,194 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:08,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-12-13 05:55:08,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 471 proven. 122 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2022-12-13 05:55:08,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:55:08,287 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (Array Int Int)) (v_ArrVal_1821 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1821)) .cse1)) 20))) is different from false [2022-12-13 05:55:08,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (Array Int Int)) (v_ArrVal_1821 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1821)) .cse1)) 20))) is different from false [2022-12-13 05:55:08,340 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1817 Int) (v_ArrVal_1820 (Array Int Int)) (v_ArrVal_1821 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1817) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1821)) .cse1))))) is different from false [2022-12-13 05:55:08,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1815 Int) (v_ArrVal_1817 Int) (v_ArrVal_1820 (Array Int Int)) (v_ArrVal_1821 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1815)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1817) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1821)) .cse1)) 20))) is different from false [2022-12-13 05:55:08,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 Int) (v_ArrVal_1817 Int) (v_ArrVal_1820 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1810) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1813))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1815))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1817) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1821)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| (select .cse4 .cse1))))))) is different from false [2022-12-13 05:55:08,643 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 Int) (v_ArrVal_1817 Int) (v_ArrVal_1808 Int) (v_ArrVal_1820 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1808)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1810) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1813))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1815))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1817) .cse1 (+ 1 (select .cse3 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1821)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| (select .cse4 .cse1))))))) is different from false [2022-12-13 05:55:11,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 Int) (v_ArrVal_1817 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1808 Int) (v_ArrVal_1820 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1802) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1806))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1808))) (store (store .cse8 .cse5 v_ArrVal_1810) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1813))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1815))) (store (store .cse4 .cse5 v_ArrVal_1817) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1821)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| (select .cse6 .cse1))))))))) is different from false [2022-12-13 05:55:11,131 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 Int) (v_ArrVal_1817 Int) (v_ArrVal_1808 Int) (v_ArrVal_1820 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1810 Int) (v_ArrVal_1821 Int) (v_ArrVal_1802 Int) (v_ArrVal_1801 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1801)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1802) .cse10 (+ 1 (select .cse9 .cse10))))) |c_~#stored_elements~0.base| v_ArrVal_1806))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1808))) (store (store .cse8 .cse6 v_ArrVal_1810) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1813))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_202| (select .cse2 .cse1))) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1815))) (store (store .cse5 .cse6 v_ArrVal_1817) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1820) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1821)) .cse1) 20)))))))) is different from false [2022-12-13 05:55:11,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:55:11,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2165 treesize of output 1505 [2022-12-13 05:55:11,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:55:11,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1857 treesize of output 1831 [2022-12-13 05:55:11,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1870 treesize of output 1846 [2022-12-13 05:55:11,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1625 treesize of output 1529 [2022-12-13 05:55:11,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1891 treesize of output 1827 [2022-12-13 05:55:11,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2056 treesize of output 2016 [2022-12-13 05:55:11,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 05:55:11,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:55:11,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 429 [2022-12-13 05:55:12,058 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 05:55:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 283 proven. 95 refuted. 3 times theorem prover too weak. 751 trivial. 212 not checked. [2022-12-13 05:55:12,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630420050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:55:12,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:55:12,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 25] total 61 [2022-12-13 05:55:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361108340] [2022-12-13 05:55:12,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:55:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-13 05:55:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:55:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-13 05:55:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=2143, Unknown=65, NotChecked=888, Total=3782 [2022-12-13 05:55:12,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 55 [2022-12-13 05:55:12,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 2251 transitions, 45930 flow. Second operand has 62 states, 62 states have (on average 7.919354838709677) internal successors, (491), 62 states have internal predecessors, (491), 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-12-13 05:55:12,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:55:12,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 55 [2022-12-13 05:55:12,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:55:26,584 INFO L130 PetriNetUnfolder]: 6821/16239 cut-off events. [2022-12-13 05:55:26,584 INFO L131 PetriNetUnfolder]: For 75030/75030 co-relation queries the response was YES. [2022-12-13 05:55:26,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157525 conditions, 16239 events. 6821/16239 cut-off events. For 75030/75030 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 110455 event pairs, 57 based on Foata normal form. 0/13911 useless extension candidates. Maximal degree in co-relation 153353. Up to 13210 conditions per place. [2022-12-13 05:55:26,774 INFO L137 encePairwiseOnDemand]: 36/55 looper letters, 3745 selfloop transitions, 1092 changer transitions 0/4842 dead transitions. [2022-12-13 05:55:26,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 4842 transitions, 108576 flow [2022-12-13 05:55:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 05:55:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-13 05:55:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 598 transitions. [2022-12-13 05:55:26,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26518847006651886 [2022-12-13 05:55:26,779 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 73 predicate places. [2022-12-13 05:55:26,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 4842 transitions, 108576 flow [2022-12-13 05:55:26,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 4842 transitions, 108576 flow [2022-12-13 05:55:27,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:55:27,967 INFO L89 Accepts]: Start accepts. Operand has 154 places, 4842 transitions, 108576 flow [2022-12-13 05:55:28,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:55:28,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:55:28,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 4842 transitions, 108576 flow [2022-12-13 05:55:29,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 4842 transitions, 108576 flow [2022-12-13 05:55:29,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 4454 [2022-12-13 05:55:29,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [768] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_400|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_400|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] [2022-12-13 05:55:29,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,707 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [638] L1053-4-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_7|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1] [2022-12-13 05:55:29,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L988-->L988-1: Formula: (= (select (select |v_#memory_int_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|) InVars {#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} OutVars{#memory_int=|v_#memory_int_29|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_3|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [833] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_620| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_620|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_37|, #memory_int=|v_#memory_int_620|, ULTIMATE.start_main_#t~nondet62#1=|v_ULTIMATE.start_main_#t~nondet62#1_27|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_39|, ULTIMATE.start_main_#t~mem63#1=|v_ULTIMATE.start_main_#t~mem63#1_30|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, ULTIMATE.start_main_#t~nondet62#1, ULTIMATE.start_main_#t~mem63#1] [2022-12-13 05:55:29,985 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:55:29,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2019 [2022-12-13 05:55:29,986 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 4841 transitions, 108686 flow [2022-12-13 05:55:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 7.919354838709677) internal successors, (491), 62 states have internal predecessors, (491), 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-12-13 05:55:29,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:55:29,986 INFO L214 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 17, 15, 15, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:55:29,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 05:55:30,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:55:30,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:55:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:55:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1842755591, now seen corresponding path program 1 times [2022-12-13 05:55:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:55:30,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20692348] [2022-12-13 05:55:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:55:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 731 proven. 484 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-12-13 05:55:38,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:55:38,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20692348] [2022-12-13 05:55:38,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20692348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:55:38,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115852927] [2022-12-13 05:55:38,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:55:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:55:38,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:55:38,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 05:55:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:38,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 262 conjunts are in the unsatisfiable core [2022-12-13 05:55:38,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:55:39,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 05:55:39,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:39,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:39,415 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 05:55:39,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 05:55:39,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:39,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:39,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:39,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:39,626 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:39,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:39,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:39,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:39,792 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:39,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:39,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:39,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:39,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:39,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:39,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:39,992 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:39,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:40,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:40,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:40,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:40,206 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:40,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:40,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:40,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:40,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:40,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:40,425 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:40,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:40,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:40,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:40,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:40,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:40,695 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:40,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:40,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:40,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:40,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:40,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:40,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:40,951 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:40,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:41,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:41,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:41,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:41,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:41,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:41,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:41,197 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:41,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:41,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:41,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:41,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:41,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:41,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:41,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:41,464 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:41,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:41,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:41,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:41,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 05:55:41,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:55:41,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 05:55:41,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:55:41,702 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 05:55:41,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 05:55:41,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 05:55:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 736 proven. 456 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-12-13 05:55:41,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:55:41,811 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2293)) .cse1))))) is different from false [2022-12-13 05:55:41,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2)) 20)))))) is different from false [2022-12-13 05:55:41,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2287 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2287) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2)) 20)))))) is different from false [2022-12-13 05:55:41,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2285)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= 20 (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2287) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2)))))))) is different from false [2022-12-13 05:55:42,023 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2285)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2287) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20))))))) is different from false [2022-12-13 05:55:42,141 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_2285)))) (let ((.cse5 (select .cse4 .cse2))) (or (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2287) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20)) (= .cse5 20))))))))) is different from false [2022-12-13 05:55:42,157 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2281) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2285)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2287) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20))))))) (= .cse8 20)))) is different from false [2022-12-13 05:55:42,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2278)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2281) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2287) .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse1) 20)) (= 20 .cse5) (= 20 .cse4)))))))) is different from false [2022-12-13 05:55:42,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2281) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ 1 .cse6))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2293)) .cse2) 20)) (= 20 .cse6))))))))) is different from false [2022-12-13 05:55:42,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13))) (or (= .cse0 20) (forall ((v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2274) .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2281) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse2 (select .cse6 .cse4))) (or (= .cse1 20) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2287) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse4) 20))))))))))))) is different from false [2022-12-13 05:55:42,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2272)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse12 .cse13))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2274) .cse13 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_2278)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2281) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse3 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2287) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse1) 20)) (= .cse6 20) (= .cse5 20) (= .cse7 20))))))))))) is different from false [2022-12-13 05:55:42,761 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse1))) v_ArrVal_2272)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse13 .cse1))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2274) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_2278)))) (let ((.cse6 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2281) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse3 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2287) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= .cse5 20)))))))))))) is different from false [2022-12-13 05:55:42,908 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse13 .cse2))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse5 v_ArrVal_2274) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse7 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2281) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20)) (= .cse6 20) (= .cse7 20)))))))))))) is different from false [2022-12-13 05:55:43,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse16 .cse17))) (or (= .cse0 20) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2266) .cse17 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2274) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_2278)))) (let ((.cse8 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2281) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_2285)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse3))) (= .cse8 20) (= .cse7 20))))))))))))))) is different from false [2022-12-13 05:55:43,144 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int)) (let ((.cse16 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2264)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse16 .cse17))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2266) .cse17 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse14 .cse5))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_2274) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse5) 4)) v_ArrVal_2278)))) (let ((.cse0 (select .cse11 .cse5))) (let ((.cse6 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_2281) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse7 (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse2 (select .cse7 .cse5))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (= .cse3 20) (not (= 20 (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2287) .cse5 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse5)))))))))))))))) is different from false [2022-12-13 05:55:43,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse17 .cse2))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse5 v_ArrVal_2266) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse0 (select .cse14 .cse2))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_2274) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse8 (select .cse11 .cse2))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2281) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse9 (select .cse3 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20)) (= .cse7 20) (= 20 .cse6) (= 20 .cse8))))))))))))))) is different from false [2022-12-13 05:55:43,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse17 .cse3))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2266) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse7 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2274) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse1 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2281) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse0 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse3) 20)) (= .cse7 20) (= .cse8 20))))))))))))))) is different from false [2022-12-13 05:55:43,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse19 .cse20 (+ (select .cse19 .cse20) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse3) 4)) v_ArrVal_2264)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse17 .cse3))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2266) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_2272)))) (let ((.cse7 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2274) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse0 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2281) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_2285)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2293)) .cse3) 20)) (= .cse7 20) (= 20 .cse8))))))))))))))) is different from false [2022-12-13 05:55:43,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (select .cse19 .cse20))) (or (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2259 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse19 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2259) .cse20 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse17 .cse3))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2266) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_2272)))) (let ((.cse8 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2274) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse1 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2281) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2293)) .cse3) 20)) (= 20 .cse7) (= .cse8 20))))))))))))))) (= .cse21 20)))) is different from false [2022-12-13 05:55:43,728 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse20 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2257)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse20 .cse21))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2259) .cse21 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_2264)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse18 .cse2))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2266) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse9 (select .cse15 .cse2))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_2274) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse7 (select .cse12 .cse2))) (let ((.cse3 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2281) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse10 (select .cse3 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20)) (= 20 .cse7) (= 20 .cse8) (= 20 .cse9) (= .cse6 20))))))))))))))))) is different from false [2022-12-13 05:55:43,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse21 .cse6))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse9 v_ArrVal_2259) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse1 (select .cse18 .cse6))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_2266) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse6) 4)) v_ArrVal_2272)))) (let ((.cse3 (select .cse15 .cse6))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse9 v_ArrVal_2274) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse6))) v_ArrVal_2278)))) (let ((.cse0 (select .cse12 .cse6))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2281) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse4 (select .cse8 .cse6))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (= 20 .cse3) (= .cse4 20) (not (= 20 (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2287) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse6)))))))))))))))))))) is different from false [2022-12-13 05:55:44,045 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* 4 (select .cse22 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse21 .cse2))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_2259) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse7 (select .cse18 .cse2))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2266) .cse2 (+ 1 .cse7))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse2) 4)) v_ArrVal_2272)))) (let ((.cse8 (select .cse15 .cse2))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_2274) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)) v_ArrVal_2278)))) (let ((.cse9 (select .cse12 .cse2))) (let ((.cse3 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2281) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse10 (select .cse3 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2293)) .cse2) 20)) (= .cse6 20) (= 20 .cse7) (= .cse8 20) (= .cse9 20)))))))))))))))))) is different from false [2022-12-13 05:55:44,570 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse24 .cse25))) (or (= .cse0 20) (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2252) .cse25 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse22 .cse3))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse6 v_ArrVal_2259) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* 4 (select .cse20 .cse3))) v_ArrVal_2264)))) (let ((.cse1 (select .cse19 .cse3))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_2266) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse10 (select .cse16 .cse3))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse6 v_ArrVal_2274) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse8 (select .cse13 .cse3))) (let ((.cse4 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_2281) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse11 (select .cse4 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse3) 20)) (= .cse8 20) (= .cse9 20) (= .cse7 20) (= .cse10 20))))))))))))))))))))) is different from false [2022-12-13 05:55:44,683 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse24 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2250)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse24 .cse25))) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2252) .cse25 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse7)) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse22 .cse7))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse10 v_ArrVal_2259) .cse7 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse4 (select .cse19 .cse7))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse10 v_ArrVal_2266) .cse7 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) v_ArrVal_2272)))) (let ((.cse1 (select .cse16 .cse7))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse10 v_ArrVal_2274) .cse7 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse3 (select .cse13 .cse7))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse10 v_ArrVal_2281) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse9 (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse5 (select .cse9 .cse7))) (or (= 20 .cse0) (= .cse1 20) (= .cse2 20) (= .cse3 20) (= .cse4 20) (= .cse5 20) (not (= (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2287) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_2293)) .cse7) 20))))))))))))))))))))) is different from false [2022-12-13 05:55:45,854 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse29 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse28 .cse29))) (or (= .cse0 20) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse25 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse28 .cse29 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* 4 (select .cse27 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse26 .cse6))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse9 v_ArrVal_2252) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse6) 4)) v_ArrVal_2257)))) (let ((.cse3 (select .cse23 .cse6))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse9 v_ArrVal_2259) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse10 (select .cse20 .cse6))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse9 v_ArrVal_2266) .cse6 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* 4 (select .cse18 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse11 (select .cse17 .cse6))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_2274) .cse6 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse4 (select .cse14 .cse6))) (let ((.cse7 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse9 v_ArrVal_2281) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse8 (let ((.cse12 (select .cse7 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse1 (select .cse8 .cse6))) (or (= .cse1 20) (= .cse2 20) (= 20 .cse3) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2287) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse6) 20)) (= .cse10 20) (= .cse11 20)))))))))))))))))))))))) is different from false [2022-12-13 05:55:45,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse29 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse28 .cse29))) (or (= .cse0 20) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2278 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse25 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse28 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2245) .cse29 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse11 (select .cse26 .cse3))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_2252) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse3) 4)) v_ArrVal_2257)))) (let ((.cse8 (select .cse23 .cse3))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse6 v_ArrVal_2259) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse7 (select .cse20 .cse3))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_2266) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse3))) v_ArrVal_2272)))) (let ((.cse10 (select .cse17 .cse3))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2274) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_2278)))) (let ((.cse9 (select .cse14 .cse3))) (let ((.cse4 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2281) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse12 (select .cse4 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2293)) .cse3) 20)) (= .cse7 20) (= .cse8 20) (= .cse9 20) (= .cse10 20) (= .cse11 20)))))))))))))))))))))))) is different from false [2022-12-13 05:55:46,065 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2278 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse28 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2244)) (.cse29 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse28 .cse29))) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse25 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse28 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2245) .cse29 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse11 (select .cse26 .cse7))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse10 v_ArrVal_2252) .cse7 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse5 (select .cse23 .cse7))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse10 v_ArrVal_2259) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse0 (select .cse20 .cse7))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse10 v_ArrVal_2266) .cse7 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse4 (select .cse17 .cse7))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse10 v_ArrVal_2274) .cse7 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse3 (select .cse14 .cse7))) (let ((.cse8 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse10 v_ArrVal_2281) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse9 (let ((.cse12 (select .cse8 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)) v_ArrVal_2285)))) (let ((.cse2 (select .cse9 .cse7))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (= .cse3 20) (= 20 .cse4) (= 20 .cse5) (not (= (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2287) .cse7 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_2293)) .cse7) 20)) (= 20 .cse11))))))))))))))))))))))) is different from false [2022-12-13 05:55:46,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2278 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse8 (+ 84 |c_~#queue~0.offset|)) (.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse8) 4)) v_ArrVal_2244)))) (let ((.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse29 .cse8))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse11 v_ArrVal_2245) .cse8 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse8) 4)) v_ArrVal_2250)))) (let ((.cse1 (select .cse26 .cse8))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse11 v_ArrVal_2252) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse0 (select .cse23 .cse8))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse11 v_ArrVal_2259) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse8) 4)) v_ArrVal_2264)))) (let ((.cse5 (select .cse20 .cse8))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse11 v_ArrVal_2266) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse6 (select .cse17 .cse8))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse11 v_ArrVal_2274) .cse8 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse2 (select .cse14 .cse8))) (let ((.cse9 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse11 v_ArrVal_2281) .cse8 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse10 (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse4 (select .cse10 .cse8))) (or (= .cse0 20) (= 20 .cse1) (= 20 .cse2) (= .cse3 20) (= 20 .cse4) (= 20 .cse5) (= 20 .cse6) (not (= (select (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2287) .cse8 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse8) 20))))))))))))))))))))))))) is different from false [2022-12-13 05:55:46,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2278 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse31 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse32 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse31 .cse32 (+ (select .cse31 .cse32) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse29 .cse1))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse4 v_ArrVal_2245) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse11 (select .cse26 .cse1))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse4 v_ArrVal_2252) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse10 (select .cse23 .cse1))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse4 v_ArrVal_2259) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse6 (select .cse20 .cse1))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_2266) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse7 (select .cse17 .cse1))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse4 v_ArrVal_2274) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) v_ArrVal_2278)))) (let ((.cse8 (select .cse14 .cse1))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2281) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse3 (let ((.cse12 (select .cse2 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2287) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= 20 .cse8) (= 20 .cse9) (= .cse10 20) (= 20 .cse5) (= 20 .cse11)))))))))))))))))))))))) is different from false [2022-12-13 05:55:47,071 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse33 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse32 .cse33))) (or (= .cse0 20) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2250 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2272 Int) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2278 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2257 Int) (v_ArrVal_2259 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse29 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse32 .cse33 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse30 .cse2))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse5 v_ArrVal_2245) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse12 (select .cse27 .cse2))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse5 v_ArrVal_2252) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse11 (select .cse24 .cse2))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse5 v_ArrVal_2259) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse7 (select .cse21 .cse2))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_2266) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse8 (select .cse18 .cse2))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2274) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse2) 4)) v_ArrVal_2278)))) (let ((.cse9 (select .cse15 .cse2))) (let ((.cse3 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_2281) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse13 (select .cse3 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2) 20)) (= .cse7 20) (= .cse8 20) (= 20 .cse9) (= 20 .cse10) (= .cse11 20) (= 20 .cse6) (= 20 .cse12))))))))))))))))))))))))))) is different from false [2022-12-13 05:55:47,164 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse32 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse33 (select .cse31 .cse32))) (or (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2278 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2238) .cse32 (+ .cse33 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse11 (select .cse29 .cse1))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse4 v_ArrVal_2245) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse7 (select .cse26 .cse1))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse4 v_ArrVal_2252) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse1) 4)) v_ArrVal_2257)))) (let ((.cse10 (select .cse23 .cse1))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse4 v_ArrVal_2259) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)) v_ArrVal_2264)))) (let ((.cse6 (select .cse20 .cse1))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_2266) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2272)))) (let ((.cse9 (select .cse17 .cse1))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse4 v_ArrVal_2274) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))) v_ArrVal_2278)))) (let ((.cse8 (select .cse14 .cse1))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2281) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse3 (let ((.cse12 (select .cse2 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2287) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse1))) (= 20 .cse6) (= .cse7 20) (= .cse8 20) (= .cse9 20) (= .cse10 20) (= 20 .cse5) (= 20 .cse11)))))))))))))))))))))))) (= .cse33 20)))) is different from false [2022-12-13 05:55:47,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int)) (let ((.cse32 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2236)) (.cse33 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (select .cse32 .cse33))) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse29 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse32 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2238) .cse33 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ |c_~#queue~0.offset| (* 4 (select .cse31 .cse7))) v_ArrVal_2244)))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse30 .cse7))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse10 v_ArrVal_2245) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse2 (select .cse27 .cse7))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse10 v_ArrVal_2252) .cse7 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* 4 (select .cse25 .cse7)) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse4 (select .cse24 .cse7))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse10 v_ArrVal_2259) .cse7 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse7) 4)) v_ArrVal_2264)))) (let ((.cse0 (select .cse21 .cse7))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse10 v_ArrVal_2266) .cse7 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse7)) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse3 (select .cse18 .cse7))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse10 v_ArrVal_2274) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse12 (select .cse15 .cse7))) (let ((.cse8 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse10 v_ArrVal_2281) .cse7 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse9 (let ((.cse13 (select .cse8 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse7) 4)) v_ArrVal_2285)))) (let ((.cse1 (select .cse9 .cse7))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (= .cse3 20) (= 20 .cse4) (= .cse5 20) (not (= 20 (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2287) .cse7 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse7))) (= .cse11 20) (= .cse12 20)))))))))))))))))))))))))) is different from false [2022-12-13 05:55:48,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse32 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse33 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse3) 4)) v_ArrVal_2236)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse11 (select .cse33 .cse3))) (let ((.cse29 (store (store .cse32 |c_~#queue~0.base| (store (store .cse33 .cse6 v_ArrVal_2238) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ |c_~#queue~0.offset| (* 4 (select .cse31 .cse3))) v_ArrVal_2244)))) (let ((.cse8 (select .cse30 .cse3))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse6 v_ArrVal_2245) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse0 (select .cse27 .cse3))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse6 v_ArrVal_2252) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse12 (select .cse24 .cse3))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse6 v_ArrVal_2259) .cse3 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse9 (select .cse21 .cse3))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse6 v_ArrVal_2266) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse3) 4)) v_ArrVal_2272)))) (let ((.cse1 (select .cse18 .cse3))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse6 v_ArrVal_2274) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse10 (select .cse15 .cse3))) (let ((.cse4 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse6 v_ArrVal_2281) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse13 (select .cse4 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse7 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ 1 .cse7))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse3) 20)) (= .cse8 20) (= .cse9 20) (= .cse10 20) (= 20 .cse7) (= .cse11 20) (= .cse12 20))))))))))))))))))))))))))) is different from false [2022-12-13 05:55:48,166 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse32 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse35 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse36 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse35 .cse36 (+ (select .cse35 .cse36) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse33 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2236)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse12 (select .cse33 .cse2))) (let ((.cse29 (store (store .cse32 |c_~#queue~0.base| (store (store .cse33 .cse5 v_ArrVal_2238) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse7 (select .cse30 .cse2))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse5 v_ArrVal_2245) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse0 (select .cse27 .cse2))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse5 v_ArrVal_2252) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) v_ArrVal_2257)))) (let ((.cse11 (select .cse24 .cse2))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse5 v_ArrVal_2259) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse2) 4)) v_ArrVal_2264)))) (let ((.cse9 (select .cse21 .cse2))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_2266) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_2272)))) (let ((.cse8 (select .cse18 .cse2))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2274) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse2) 4)) v_ArrVal_2278)))) (let ((.cse10 (select .cse15 .cse2))) (let ((.cse3 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_2281) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse13 (select .cse3 |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse2))) (= 20 .cse7) (= .cse8 20) (= .cse9 20) (= .cse6 20) (= .cse10 20) (= .cse11 20) (= .cse12 20))))))))))))))))))))))))))) is different from false [2022-12-13 05:55:48,572 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse36 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse37 (select .cse35 .cse36))) (or (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2231 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse32 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse35 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2231) .cse36 (+ .cse37 1))) |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse33 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2236)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse12 (select .cse33 .cse2))) (let ((.cse29 (store (store .cse32 |c_~#queue~0.base| (store (store .cse33 .cse5 v_ArrVal_2238) .cse2 (+ 1 .cse12))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse7 (select .cse30 .cse2))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse5 v_ArrVal_2245) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse10 (select .cse27 .cse2))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse5 v_ArrVal_2252) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse8 (select .cse24 .cse2))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse5 v_ArrVal_2259) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse2) 4)) v_ArrVal_2264)))) (let ((.cse9 (select .cse21 .cse2))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_2266) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_2272)))) (let ((.cse0 (select .cse18 .cse2))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2274) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse11 (select .cse15 .cse2))) (let ((.cse3 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_2281) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse4 (let ((.cse13 (select .cse3 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2287) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2293)) .cse2))) (= .cse7 20) (= .cse8 20) (= .cse9 20) (= .cse6 20) (= .cse10 20) (= .cse11 20) (= 20 .cse12))))))))))))))))))))))))))) (= .cse37 20)))) is different from false [2022-12-13 05:55:48,807 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2231 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2229 Int)) (let ((.cse36 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2229)) (.cse37 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse36 .cse37))) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse33 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse36 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2231) .cse37 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse34 (let ((.cse35 (select .cse33 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2236)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse34 .cse6))) (let ((.cse30 (store (store .cse33 |c_~#queue~0.base| (store (store .cse34 .cse9 v_ArrVal_2238) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse31 (let ((.cse32 (select .cse30 |c_~#queue~0.base|))) (store .cse32 (+ |c_~#queue~0.offset| (* 4 (select .cse32 .cse6))) v_ArrVal_2244)))) (let ((.cse4 (select .cse31 .cse6))) (let ((.cse27 (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse9 v_ArrVal_2245) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse6) 4)) v_ArrVal_2250)))) (let ((.cse1 (select .cse28 .cse6))) (let ((.cse24 (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse9 v_ArrVal_2252) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2257)))) (let ((.cse11 (select .cse25 .cse6))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse9 v_ArrVal_2259) .cse6 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse12 (select .cse22 .cse6))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_2266) .cse6 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse0 (select .cse19 .cse6))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse9 v_ArrVal_2274) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse6) 4)) v_ArrVal_2278)))) (let ((.cse10 (select .cse16 .cse6))) (let ((.cse7 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_2281) .cse6 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse8 (let ((.cse14 (select .cse7 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse6) 4)) v_ArrVal_2285)))) (let ((.cse2 (select .cse8 .cse6))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (= .cse3 20) (= 20 .cse4) (not (= 20 (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2287) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_2293)) .cse6))) (= 20 .cse10) (= 20 .cse11) (= .cse12 20) (= 20 .cse13))))))))))))))))))))))))))))) is different from false [2022-12-13 05:55:51,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse39 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse40 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse41 (select .cse39 .cse40))) (or (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2231 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2225 Int) (v_ArrVal_2229 Int)) (let ((.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse36 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse39 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2225) .cse40 (+ .cse41 1))) |c_~#stored_elements~0.base| v_ArrVal_2228))) (let ((.cse37 (let ((.cse38 (select .cse36 |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2229)))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse37 .cse9))) (let ((.cse33 (store (store .cse36 |c_~#queue~0.base| (store (store .cse37 .cse12 v_ArrVal_2231) .cse9 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse34 (let ((.cse35 (select .cse33 |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2236)))) (let ((.cse13 (select .cse34 .cse9))) (let ((.cse30 (store (store .cse33 |c_~#queue~0.base| (store (store .cse34 .cse12 v_ArrVal_2238) .cse9 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse31 (let ((.cse32 (select .cse30 |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse4 (select .cse31 .cse9))) (let ((.cse27 (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse12 v_ArrVal_2245) .cse9 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse2 (select .cse28 .cse9))) (let ((.cse24 (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse12 v_ArrVal_2252) .cse9 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse9) 4)) v_ArrVal_2257)))) (let ((.cse0 (select .cse25 .cse9))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse12 v_ArrVal_2259) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse1 (select .cse22 .cse9))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse12 v_ArrVal_2266) .cse9 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse9) 4)) v_ArrVal_2272)))) (let ((.cse5 (select .cse19 .cse9))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse12 v_ArrVal_2274) .cse9 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse9)) |c_~#queue~0.offset|) v_ArrVal_2278)))) (let ((.cse6 (select .cse16 .cse9))) (let ((.cse10 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse12 v_ArrVal_2281) .cse9 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse11 (let ((.cse14 (select .cse10 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse7 (select .cse11 .cse9))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (= .cse3 20) (= .cse4 20) (= 20 .cse5) (= .cse6 20) (= .cse7 20) (not (= (select (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_2287) .cse9 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse9) 20)) (= 20 .cse13)))))))))))))))))))))))))))))) (= .cse41 20)))) is different from false [2022-12-13 05:55:51,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2231 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2222 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2225 Int) (v_ArrVal_2229 Int)) (let ((.cse40 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2222)) (.cse41 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse40 .cse41))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse37 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse40 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2225) .cse41 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2228))) (let ((.cse38 (let ((.cse39 (select .cse37 |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* 4 (select .cse39 .cse3))) v_ArrVal_2229)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse12 (select .cse38 .cse3))) (let ((.cse34 (store (store .cse37 |c_~#queue~0.base| (store (store .cse38 .cse6 v_ArrVal_2231) .cse3 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse35 (let ((.cse36 (select .cse34 |c_~#queue~0.base|))) (store .cse36 (+ |c_~#queue~0.offset| (* (select .cse36 .cse3) 4)) v_ArrVal_2236)))) (let ((.cse1 (select .cse35 .cse3))) (let ((.cse31 (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_2238) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse32 (let ((.cse33 (select .cse31 |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse10 (select .cse32 .cse3))) (let ((.cse28 (store (store .cse31 |c_~#queue~0.base| (store (store .cse32 .cse6 v_ArrVal_2245) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse8 (select .cse29 .cse3))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse6 v_ArrVal_2252) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* 4 (select .cse27 .cse3))) v_ArrVal_2257)))) (let ((.cse13 (select .cse26 .cse3))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse6 v_ArrVal_2259) .cse3 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse14 (select .cse23 .cse3))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse6 v_ArrVal_2266) .cse3 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) v_ArrVal_2272)))) (let ((.cse11 (select .cse20 .cse3))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_2274) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse3) 4)) v_ArrVal_2278)))) (let ((.cse9 (select .cse17 .cse3))) (let ((.cse4 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2281) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse5 (let ((.cse15 (select .cse4 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_2285)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2287) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2293)) .cse3) 20)) (= .cse8 20) (= .cse9 20) (= .cse10 20) (= .cse11 20) (= .cse12 20) (= .cse13 20) (= .cse7 20) (= 20 .cse14)))))))))))))))))))))))))))))))) is different from false [2022-12-13 05:55:52,977 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2250 Int) (v_ArrVal_2272 Int) (v_ArrVal_2293 Int) (v_ArrVal_2252 Int) (v_ArrVal_2274 Int) (v_ArrVal_2231 Int) (v_ArrVal_2278 Int) (v_ArrVal_2236 Int) (v_ArrVal_2257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_259| Int) (v_ArrVal_2238 Int) (v_ArrVal_2259 Int) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2281 Int) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2291 (Array Int Int)) (v_ArrVal_2285 Int) (v_ArrVal_2287 Int) (v_ArrVal_2264 Int) (v_ArrVal_2245 Int) (v_ArrVal_2222 Int) (v_ArrVal_2244 Int) (v_ArrVal_2266 Int) (v_ArrVal_2225 Int) (v_ArrVal_2229 Int)) (let ((.cse41 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2221))) (let ((.cse15 (select .cse41 |c_~#queue~0.base|))) (let ((.cse42 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_259| 4) |c_~#queue~0.offset|) v_ArrVal_2222)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse14 (select .cse42 .cse6))) (let ((.cse38 (store (store .cse41 |c_~#queue~0.base| (store (store .cse42 .cse9 v_ArrVal_2225) .cse6 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_2228))) (let ((.cse39 (let ((.cse40 (select .cse38 |c_~#queue~0.base|))) (store .cse40 (+ |c_~#queue~0.offset| (* (select .cse40 .cse6) 4)) v_ArrVal_2229)))) (let ((.cse0 (select .cse39 .cse6))) (let ((.cse35 (store (store .cse38 |c_~#queue~0.base| (store (store .cse39 .cse9 v_ArrVal_2231) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2235))) (let ((.cse36 (let ((.cse37 (select .cse35 |c_~#queue~0.base|))) (store .cse37 (+ (* 4 (select .cse37 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2236)))) (let ((.cse4 (select .cse36 .cse6))) (let ((.cse32 (store (store .cse35 |c_~#queue~0.base| (store (store .cse36 .cse9 v_ArrVal_2238) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2242))) (let ((.cse33 (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2244)))) (let ((.cse2 (select .cse33 .cse6))) (let ((.cse29 (store (store .cse32 |c_~#queue~0.base| (store (store .cse33 .cse9 v_ArrVal_2245) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2249))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2250)))) (let ((.cse13 (select .cse30 .cse6))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse9 v_ArrVal_2252) .cse6 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2256))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse6) 4)) v_ArrVal_2257)))) (let ((.cse3 (select .cse27 .cse6))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse9 v_ArrVal_2259) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2263))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* 4 (select .cse25 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2264)))) (let ((.cse12 (select .cse24 .cse6))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse9 v_ArrVal_2266) .cse6 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2270))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2272)))) (let ((.cse1 (select .cse21 .cse6))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse9 v_ArrVal_2274) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2277))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse6) 4)) v_ArrVal_2278)))) (let ((.cse11 (select .cse18 .cse6))) (let ((.cse7 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_2281) .cse6 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2284))) (let ((.cse8 (let ((.cse16 (select .cse7 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2285)))) (let ((.cse10 (select .cse8 .cse6))) (or (= .cse0 20) (= 20 .cse1) (= .cse2 20) (= .cse3 20) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2287) .cse6 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2291) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse6))) v_ArrVal_2293)) .cse6) 20)) (= .cse11 20) (= .cse12 20) (= .cse10 20) (= .cse13 20) (= 20 .cse14) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_259| (select .cse15 .cse6)))))))))))))))))))))))))))))))))))) is different from false [2022-12-13 05:55:53,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:55:53,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 449218718 treesize of output 302734348 [2022-12-13 05:59:47,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:59:47,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8237761 treesize of output 8060619 [2022-12-13 06:00:58,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5172508 treesize of output 5146692 [2022-12-13 06:01:18,909 WARN L233 SmtUtils]: Spent 20.00s on a formula simplification. DAG size of input: 4013 DAG size of output: 3939 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:01:19,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4254822 treesize of output 4242534 [2022-12-13 06:01:20,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5688650 treesize of output 5672266 [2022-12-13 06:01:22,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6188024 treesize of output 6162424 [2022-12-13 06:01:42,650 WARN L233 SmtUtils]: Spent 19.87s on a formula simplification. DAG size of input: 3957 DAG size of output: 3955 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:01:43,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6328068 treesize of output 6305540 [2022-12-13 06:02:06,799 WARN L233 SmtUtils]: Spent 23.75s on a formula simplification. DAG size of input: 3990 DAG size of output: 3984 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:02:07,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6319990 treesize of output 6294134 [2022-12-13 06:02:38,251 WARN L233 SmtUtils]: Spent 30.87s on a formula simplification. DAG size of input: 4069 DAG size of output: 4039 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:02:39,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6367052 treesize of output 6266188 [2022-12-13 06:03:21,039 WARN L233 SmtUtils]: Spent 42.00s on a formula simplification. DAG size of input: 4165 DAG size of output: 4157 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:03:21,047 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-13 06:03:22,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5890885 treesize of output 5882245 [2022-12-13 06:04:02,318 WARN L233 SmtUtils]: Spent 39.36s on a formula simplification. DAG size of input: 4433 DAG size of output: 4307 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:04:06,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5451846 treesize of output 5399238 [2022-12-13 06:04:49,275 WARN L233 SmtUtils]: Spent 42.68s on a formula simplification. DAG size of input: 4676 DAG size of output: 4594 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:04:57,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4553990 treesize of output 4546646 [2022-12-13 06:05:42,225 WARN L233 SmtUtils]: Spent 44.61s on a formula simplification. DAG size of input: 5923 DAG size of output: 5717 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:06:10,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3177926 treesize of output 3173542 [2022-12-13 06:06:52,083 WARN L233 SmtUtils]: Spent 41.21s on a formula simplification. DAG size of input: 7668 DAG size of output: 7248 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 06:07:03,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 06:08:27,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:08:27,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 816253 treesize of output 751969 [2022-12-13 06:08:46,051 WARN L233 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 5047 DAG size of output: 4971 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-12-13 06:08:47,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 06:08:47,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 06:08:47,775 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 06:08:47,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 06:08:47,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 06:08:47,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 06:08:47,984 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 53ms.. [2022-12-13 06:08:47,985 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 06:08:47,985 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 06:08:47,985 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 06:08:47,985 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 06:08:47,986 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:47,991 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:08:47,992 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:08:47,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:08:47 BasicIcfg [2022-12-13 06:08:47,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:08:47,994 INFO L158 Benchmark]: Toolchain (without parser) took 851919.31ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 165.8MB in the beginning and 1.0GB in the end (delta: -869.2MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-13 06:08:47,994 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:08:47,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.73ms. Allocated memory is still 191.9MB. Free memory was 165.8MB in the beginning and 136.0MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 06:08:47,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.94ms. Allocated memory is still 191.9MB. Free memory was 136.0MB in the beginning and 132.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:08:47,994 INFO L158 Benchmark]: Boogie Preprocessor took 21.46ms. Allocated memory is still 191.9MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:08:47,994 INFO L158 Benchmark]: RCFGBuilder took 493.68ms. Allocated memory is still 191.9MB. Free memory was 130.7MB in the beginning and 154.7MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 06:08:47,994 INFO L158 Benchmark]: TraceAbstraction took 850824.65ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 153.7MB in the beginning and 1.0GB in the end (delta: -881.3MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-13 06:08:47,995 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.15ms. Allocated memory is still 191.9MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 517.73ms. Allocated memory is still 191.9MB. Free memory was 165.8MB in the beginning and 136.0MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.94ms. Allocated memory is still 191.9MB. Free memory was 136.0MB in the beginning and 132.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.46ms. Allocated memory is still 191.9MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 493.68ms. Allocated memory is still 191.9MB. Free memory was 130.7MB in the beginning and 154.7MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 850824.65ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 153.7MB in the beginning and 1.0GB in the end (delta: -881.3MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 198 PlacesBefore, 81 PlacesAfterwards, 204 TransitionsBefore, 82 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 6 ChoiceCompositions, 167 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 9459, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7053, independent: 6946, independent conditional: 0, independent unconditional: 6946, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7053, independent: 6926, independent conditional: 0, independent unconditional: 6926, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 127, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9707, independent: 2513, independent conditional: 0, independent unconditional: 2513, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 7053, unknown conditional: 0, unknown unconditional: 7053] , Statistics on independence cache: Total cache size (in pairs): 14193, Positive cache size: 14086, Positive conditional cache size: 0, Positive unconditional cache size: 14086, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 53 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 27, independent conditional: 8, independent unconditional: 19, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 336 TransitionsBefore, 336 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 68, independent conditional: 66, independent unconditional: 2, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 178, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 816 TransitionsBefore, 816 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 114 PlacesBefore, 114 PlacesAfterwards, 2251 TransitionsBefore, 2251 TransitionsAfterwards, 2234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 154 PlacesBefore, 153 PlacesAfterwards, 4842 TransitionsBefore, 4841 TransitionsAfterwards, 4454 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 53ms.. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 53ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 53ms.. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 53ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 325 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 850.7s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2464 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2464 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2487 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 278 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5043 IncrementalHoareTripleChecker+Invalid, 7808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 278 mSolverCounterUnsat, 1 mSDtfsCounter, 5043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1247 SyntacticMatches, 60 SemanticMatches, 198 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 4877 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108686occurred in iteration=10, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1403 NumberOfCodeBlocks, 1403 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2042 ConstructedInterpolants, 41 QuantifiedInterpolants, 22466 SizeOfPredicates, 52 NumberOfNonLiveVariables, 4873 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 11153/13129 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown