/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:50:29,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:50:29,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:50:29,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:50:29,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:50:29,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:50:29,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:50:29,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:50:29,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:50:29,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:50:29,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:50:29,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:50:29,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:50:29,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:50:29,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:50:29,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:50:29,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:50:29,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:50:29,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:50:29,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:50:29,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:50:29,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:50:29,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:50:29,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:50:29,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:50:29,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:50:29,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:50:29,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:50:29,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:50:29,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:50:29,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:50:29,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:50:29,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:50:29,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:50:29,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:50:29,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:50:29,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:50:29,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:50:29,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:50:29,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:50:29,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:50:29,491 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-05 22:50:29,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:50:29,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:50:29,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:50:29,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:50:29,515 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:50:29,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:50:29,516 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:50:29,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:50:29,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:50:29,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:50:29,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:50:29,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:50:29,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:50:29,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:50:29,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:50:29,518 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 [2022-12-05 22:50:29,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:50:29,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:50:29,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:50:29,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:50:29,746 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:50:29,747 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-05 22:50:30,666 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:50:30,972 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:50:30,973 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-12-05 22:50:30,992 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864fb3b86/7f2a5d13053147639c103a552893c402/FLAG9c16757dc [2022-12-05 22:50:31,001 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864fb3b86/7f2a5d13053147639c103a552893c402 [2022-12-05 22:50:31,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:50:31,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:50:31,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:50:31,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:50:31,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:50:31,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b29693b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31, skipping insertion in model container [2022-12-05 22:50:31,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:50:31,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:50:31,252 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-05 22:50:31,255 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-05 22:50:31,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:50:31,281 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:50:31,324 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-05 22:50:31,326 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-05 22:50:31,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:50:31,376 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:50:31,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31 WrapperNode [2022-12-05 22:50:31,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:50:31,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:50:31,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:50:31,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:50:31,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,442 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-05 22:50:31,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:50:31,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:50:31,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:50:31,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:50:31,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:50:31,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:50:31,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:50:31,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:50:31,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (1/1) ... [2022-12-05 22:50:31,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:50:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:31,537 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-05 22:50:31,560 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-05 22:50:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:50:31,582 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:50:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:50:31,583 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:50:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:50:31,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:50:31,584 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:50:31,743 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:50:31,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:50:31,982 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:50:31,989 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:50:31,989 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 22:50:31,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:50:31 BoogieIcfgContainer [2022-12-05 22:50:31,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:50:31,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:50:31,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:50:31,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:50:31,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:50:31" (1/3) ... [2022-12-05 22:50:31,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cafb535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:50:31, skipping insertion in model container [2022-12-05 22:50:31,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:50:31" (2/3) ... [2022-12-05 22:50:31,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cafb535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:50:31, skipping insertion in model container [2022-12-05 22:50:31,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:50:31" (3/3) ... [2022-12-05 22:50:31,996 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-05 22:50:32,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:50:32,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:50:32,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:50:32,112 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 22:50:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-05 22:50:32,256 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-05 22:50:32,256 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:50:32,261 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-05 22:50:32,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-05 22:50:32,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-05 22:50:32,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:32,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-05 22:50:32,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-05 22:50:32,342 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-05 22:50:32,343 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 22:50:32,347 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-05 22:50:32,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-05 22:50:32,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-05 22:50:39,812 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-05 22:50:39,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:50:39,836 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;@4a7c3cf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:50:39,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 22:50:39,838 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-05 22:50:39,838 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:50:39,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:39,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 22:50:39,839 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-05 22:50:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 847, now seen corresponding path program 1 times [2022-12-05 22:50:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:39,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205479772] [2022-12-05 22:50:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:39,937 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-05 22:50:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205479772] [2022-12-05 22:50:39,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205479772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:50:39,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:50:39,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 22:50:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318288714] [2022-12-05 22:50:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:50:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 22:50:39,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 22:50:39,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 22:50:39,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2022-12-05 22:50:39,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-05 22:50:39,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:39,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2022-12-05 22:50:39,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:40,109 INFO L130 PetriNetUnfolder]: 751/1277 cut-off events. [2022-12-05 22:50:40,109 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-05 22:50:40,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 1277 events. 751/1277 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5564 event pairs, 582 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 2344. Up to 1178 conditions per place. [2022-12-05 22:50:40,116 INFO L137 encePairwiseOnDemand]: 45/47 looper letters, 38 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2022-12-05 22:50:40,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 175 flow [2022-12-05 22:50:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 22:50:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 22:50:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-12-05 22:50:40,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-05 22:50:40,125 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 103 flow. Second operand 2 states and 54 transitions. [2022-12-05 22:50:40,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 175 flow [2022-12-05 22:50:40,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:50:40,129 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 94 flow [2022-12-05 22:50:40,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-05 22:50:40,133 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2022-12-05 22:50:40,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:40,133 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 94 flow [2022-12-05 22:50:40,135 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:40,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:40,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 94 flow [2022-12-05 22:50:40,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 45 transitions, 94 flow [2022-12-05 22:50:40,148 INFO L130 PetriNetUnfolder]: 7/45 cut-off events. [2022-12-05 22:50:40,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:50:40,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 45 events. 7/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2022-12-05 22:50:40,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 45 transitions, 94 flow [2022-12-05 22:50:40,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-05 22:50:40,228 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:50:40,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-05 22:50:40,233 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 45 transitions, 94 flow [2022-12-05 22:50:40,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-05 22:50:40,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:40,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:40,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:50:40,234 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-05 22:50:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash 912681828, now seen corresponding path program 1 times [2022-12-05 22:50:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:40,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782039538] [2022-12-05 22:50:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:40,456 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-05 22:50:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:40,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782039538] [2022-12-05 22:50:40,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782039538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:50:40,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:50:40,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:50:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4861090] [2022-12-05 22:50:40,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:50:40,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:50:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:40,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:50:40,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:50:40,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-05 22:50:40,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-05 22:50:40,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:40,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-05 22:50:40,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:40,539 INFO L130 PetriNetUnfolder]: 289/549 cut-off events. [2022-12-05 22:50:40,539 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 22:50:40,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 549 events. 289/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2117 event pairs, 195 based on Foata normal form. 28/476 useless extension candidates. Maximal degree in co-relation 728. Up to 324 conditions per place. [2022-12-05 22:50:40,541 INFO L137 encePairwiseOnDemand]: 41/45 looper letters, 36 selfloop transitions, 2 changer transitions 11/54 dead transitions. [2022-12-05 22:50:40,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 211 flow [2022-12-05 22:50:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:50:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:50:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-05 22:50:40,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2022-12-05 22:50:40,542 INFO L175 Difference]: Start difference. First operand has 42 places, 45 transitions, 94 flow. Second operand 3 states and 67 transitions. [2022-12-05 22:50:40,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 211 flow [2022-12-05 22:50:40,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:50:40,544 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 90 flow [2022-12-05 22:50:40,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-05 22:50:40,545 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-05 22:50:40,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:40,545 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 90 flow [2022-12-05 22:50:40,545 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:40,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:40,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 90 flow [2022-12-05 22:50:40,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 90 flow [2022-12-05 22:50:40,550 INFO L130 PetriNetUnfolder]: 5/39 cut-off events. [2022-12-05 22:50:40,550 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:50:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2022-12-05 22:50:40,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 90 flow [2022-12-05 22:50:40,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-05 22:50:41,203 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 22:50:41,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 659 [2022-12-05 22:50:41,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 72 flow [2022-12-05 22:50:41,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-05 22:50:41,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:41,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:41,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:50:41,205 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-05 22:50:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1680390944, now seen corresponding path program 1 times [2022-12-05 22:50:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238776334] [2022-12-05 22:50:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:41,281 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-05 22:50:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238776334] [2022-12-05 22:50:41,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238776334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:50:41,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:50:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:50:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251663659] [2022-12-05 22:50:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:50:41,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:50:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:50:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:50:41,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 22:50:41,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:41,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:41,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 22:50:41,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:41,324 INFO L130 PetriNetUnfolder]: 66/147 cut-off events. [2022-12-05 22:50:41,324 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 22:50:41,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 66/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 471 event pairs, 3 based on Foata normal form. 18/149 useless extension candidates. Maximal degree in co-relation 157. Up to 121 conditions per place. [2022-12-05 22:50:41,325 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 29 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-05 22:50:41,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 149 flow [2022-12-05 22:50:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:50:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:50:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 22:50:41,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-05 22:50:41,326 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 72 flow. Second operand 3 states and 43 transitions. [2022-12-05 22:50:41,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 149 flow [2022-12-05 22:50:41,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:50:41,327 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 74 flow [2022-12-05 22:50:41,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2022-12-05 22:50:41,328 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2022-12-05 22:50:41,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:41,328 INFO L89 Accepts]: Start accepts. Operand has 32 places, 30 transitions, 74 flow [2022-12-05 22:50:41,329 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:41,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:41,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 30 transitions, 74 flow [2022-12-05 22:50:41,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2022-12-05 22:50:41,332 INFO L130 PetriNetUnfolder]: 5/31 cut-off events. [2022-12-05 22:50:41,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:50:41,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 31 events. 5/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2022-12-05 22:50:41,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 30 transitions, 74 flow [2022-12-05 22:50:41,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-05 22:50:41,424 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:50:41,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-05 22:50:41,425 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 70 flow [2022-12-05 22:50:41,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:41,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:41,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:41,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:50:41,426 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-05 22:50:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:41,426 INFO L85 PathProgramCache]: Analyzing trace with hash 659984688, now seen corresponding path program 1 times [2022-12-05 22:50:41,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:41,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564280012] [2022-12-05 22:50:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:41,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:41,466 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-05 22:50:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:41,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564280012] [2022-12-05 22:50:41,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564280012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:50:41,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:50:41,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:50:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725834738] [2022-12-05 22:50:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:50:41,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:50:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:50:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:50:41,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 22:50:41,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:41,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:41,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 22:50:41,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:41,519 INFO L130 PetriNetUnfolder]: 90/201 cut-off events. [2022-12-05 22:50:41,524 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 22:50:41,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 201 events. 90/201 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 618 event pairs, 42 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 180. Up to 126 conditions per place. [2022-12-05 22:50:41,524 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 34 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2022-12-05 22:50:41,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 172 flow [2022-12-05 22:50:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:50:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:50:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-05 22:50:41,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-05 22:50:41,526 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 70 flow. Second operand 3 states and 45 transitions. [2022-12-05 22:50:41,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 172 flow [2022-12-05 22:50:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:50:41,527 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 77 flow [2022-12-05 22:50:41,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-05 22:50:41,528 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2022-12-05 22:50:41,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:41,529 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 77 flow [2022-12-05 22:50:41,530 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:41,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:41,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 77 flow [2022-12-05 22:50:41,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 77 flow [2022-12-05 22:50:41,534 INFO L130 PetriNetUnfolder]: 6/37 cut-off events. [2022-12-05 22:50:41,534 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:50:41,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 37 events. 6/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2022-12-05 22:50:41,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 77 flow [2022-12-05 22:50:41,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-05 22:50:41,541 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:50:41,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 22:50:41,545 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 77 flow [2022-12-05 22:50:41,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:41,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:41,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:41,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:50:41,545 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-05 22:50:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1671174728, now seen corresponding path program 1 times [2022-12-05 22:50:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439795848] [2022-12-05 22:50:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:41,624 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-05 22:50:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439795848] [2022-12-05 22:50:41,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439795848] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:41,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947284354] [2022-12-05 22:50:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:41,641 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-05 22:50:41,692 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-05 22:50:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:41,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:50:41,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:41,805 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-05 22:50:41,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:41,825 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-05 22:50:41,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947284354] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:41,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:41,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-05 22:50:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711381015] [2022-12-05 22:50:41,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:41,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:50:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:50:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:50:41,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 22:50:41,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 77 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-05 22:50:41,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:41,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 22:50:41,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:41,943 INFO L130 PetriNetUnfolder]: 137/316 cut-off events. [2022-12-05 22:50:41,943 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-05 22:50:41,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 316 events. 137/316 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 794 event pairs, 21 based on Foata normal form. 12/300 useless extension candidates. Maximal degree in co-relation 245. Up to 69 conditions per place. [2022-12-05 22:50:41,944 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 56 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2022-12-05 22:50:41,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 285 flow [2022-12-05 22:50:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:50:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:50:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-05 22:50:41,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2022-12-05 22:50:41,946 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 77 flow. Second operand 6 states and 77 transitions. [2022-12-05 22:50:41,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 285 flow [2022-12-05 22:50:41,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:50:41,947 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 115 flow [2022-12-05 22:50:41,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-05 22:50:41,947 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2022-12-05 22:50:41,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:41,948 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 115 flow [2022-12-05 22:50:41,948 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:41,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:41,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 115 flow [2022-12-05 22:50:41,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 115 flow [2022-12-05 22:50:41,954 INFO L130 PetriNetUnfolder]: 8/58 cut-off events. [2022-12-05 22:50:41,954 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 22:50:41,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 58 events. 8/58 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 81. Up to 8 conditions per place. [2022-12-05 22:50:41,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 115 flow [2022-12-05 22:50:41,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 22:50:41,958 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:50:41,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 22:50:41,958 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 115 flow [2022-12-05 22:50:41,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-05 22:50:41,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:41,959 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:41,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 22:50:42,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:42,164 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-05 22:50:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2052387022, now seen corresponding path program 2 times [2022-12-05 22:50:42,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:42,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867689059] [2022-12-05 22:50:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:42,272 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-05 22:50:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:42,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867689059] [2022-12-05 22:50:42,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867689059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281884451] [2022-12-05 22:50:42,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:50:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:42,295 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-05 22:50:42,297 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-05 22:50:42,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:50:42,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:50:42,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 22:50:42,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:42,521 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-05 22:50:42,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:42,590 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-05 22:50:42,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281884451] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:42,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:42,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-05 22:50:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392330792] [2022-12-05 22:50:42,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:42,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 22:50:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 22:50:42,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-05 22:50:42,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 22:50:42,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 115 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-05 22:50:42,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:42,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 22:50:42,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:42,801 INFO L130 PetriNetUnfolder]: 287/682 cut-off events. [2022-12-05 22:50:42,802 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-05 22:50:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 682 events. 287/682 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1772 event pairs, 21 based on Foata normal form. 24/654 useless extension candidates. Maximal degree in co-relation 602. Up to 80 conditions per place. [2022-12-05 22:50:42,804 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 116 selfloop transitions, 12 changer transitions 0/130 dead transitions. [2022-12-05 22:50:42,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 130 transitions, 655 flow [2022-12-05 22:50:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:50:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:50:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-12-05 22:50:42,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2022-12-05 22:50:42,807 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 115 flow. Second operand 12 states and 158 transitions. [2022-12-05 22:50:42,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 130 transitions, 655 flow [2022-12-05 22:50:42,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 130 transitions, 635 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-05 22:50:42,813 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 203 flow [2022-12-05 22:50:42,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=203, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-05 22:50:42,815 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2022-12-05 22:50:42,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:42,815 INFO L89 Accepts]: Start accepts. Operand has 56 places, 38 transitions, 203 flow [2022-12-05 22:50:42,820 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:42,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:42,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 38 transitions, 203 flow [2022-12-05 22:50:42,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 38 transitions, 203 flow [2022-12-05 22:50:42,830 INFO L130 PetriNetUnfolder]: 14/118 cut-off events. [2022-12-05 22:50:42,830 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-05 22:50:42,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 118 events. 14/118 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 193. Up to 20 conditions per place. [2022-12-05 22:50:42,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 38 transitions, 203 flow [2022-12-05 22:50:42,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 22:50:42,835 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:50:42,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 22:50:42,836 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 203 flow [2022-12-05 22:50:42,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-05 22:50:42,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:42,836 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:42,857 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-05 22:50:43,041 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-05 22:50:43,042 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-05 22:50:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash -530161422, now seen corresponding path program 3 times [2022-12-05 22:50:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:43,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556238471] [2022-12-05 22:50:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:43,402 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-05 22:50:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556238471] [2022-12-05 22:50:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556238471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705207125] [2022-12-05 22:50:43,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 22:50:43,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:43,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:43,404 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-05 22:50:43,405 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-05 22:50:43,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-05 22:50:43,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:50:43,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-05 22:50:43,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:44,112 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-05 22:50:44,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:44,140 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-05 22:50:44,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:44,185 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-05 22:50:44,185 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-05 22:50:44,205 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-05 22:50:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-12-05 22:50:44,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:44,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:50:44,320 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-05 22:50:44,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:50:44,326 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-05 22:50:44,329 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-05 22:50:44,343 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-05 22:50:44,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:50:44,373 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-05 22:50:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-12-05 22:50:44,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705207125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:44,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:44,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-12-05 22:50:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611406589] [2022-12-05 22:50:44,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:44,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-05 22:50:44,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:44,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-05 22:50:44,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=477, Unknown=4, NotChecked=0, Total=600 [2022-12-05 22:50:44,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 22:50:44,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 203 flow. Second operand has 25 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:44,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:44,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 22:50:44,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:46,124 INFO L130 PetriNetUnfolder]: 716/1572 cut-off events. [2022-12-05 22:50:46,124 INFO L131 PetriNetUnfolder]: For 1015/1015 co-relation queries the response was YES. [2022-12-05 22:50:46,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 1572 events. 716/1572 cut-off events. For 1015/1015 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5517 event pairs, 20 based on Foata normal form. 8/1497 useless extension candidates. Maximal degree in co-relation 2759. Up to 215 conditions per place. [2022-12-05 22:50:46,130 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 262 selfloop transitions, 101 changer transitions 0/363 dead transitions. [2022-12-05 22:50:46,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 363 transitions, 1895 flow [2022-12-05 22:50:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-05 22:50:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-05 22:50:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 377 transitions. [2022-12-05 22:50:46,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31734006734006737 [2022-12-05 22:50:46,132 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 203 flow. Second operand 44 states and 377 transitions. [2022-12-05 22:50:46,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 363 transitions, 1895 flow [2022-12-05 22:50:46,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 363 transitions, 1883 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:50:46,138 INFO L231 Difference]: Finished difference. Result has 121 places, 141 transitions, 1027 flow [2022-12-05 22:50:46,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1027, PETRI_PLACES=121, PETRI_TRANSITIONS=141} [2022-12-05 22:50:46,139 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2022-12-05 22:50:46,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:46,139 INFO L89 Accepts]: Start accepts. Operand has 121 places, 141 transitions, 1027 flow [2022-12-05 22:50:46,143 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:46,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:46,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 141 transitions, 1027 flow [2022-12-05 22:50:46,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 141 transitions, 1027 flow [2022-12-05 22:50:46,189 INFO L130 PetriNetUnfolder]: 100/513 cut-off events. [2022-12-05 22:50:46,189 INFO L131 PetriNetUnfolder]: For 5353/5353 co-relation queries the response was YES. [2022-12-05 22:50:46,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 513 events. 100/513 cut-off events. For 5353/5353 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1570 event pairs, 0 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 1682. Up to 68 conditions per place. [2022-12-05 22:50:46,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 141 transitions, 1027 flow [2022-12-05 22:50:46,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-05 22:50:46,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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] and [801] L1011-5-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_#t~nondet51#1_24| |v_t1Thread1of1ForFork0_~value~0#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_163| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17| |v_~#queue~0.base_64|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17| |v_~#queue~0.offset_59|) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_24| 2147483647) (< |v_t1Thread1of1ForFork0_~i~0#1_47| 20) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_24| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_19| |v_t1Thread1of1ForFork0_~value~0#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_37| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_19|) (= (select (select |v_#memory_int_538| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_163|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|)) InVars {~#queue~0.base=|v_~#queue~0.base_64|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_47|, #memory_int=|v_#memory_int_538|, ~#queue~0.offset=|v_~#queue~0.offset_59|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_24|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_47|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_163|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_35|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_39|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17|, ~#queue~0.base=|v_~#queue~0.base_64|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_19|, #memory_int=|v_#memory_int_538|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_37|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_35|, ~#queue~0.offset=|v_~#queue~0.offset_59|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_47|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_35|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-05 22:50:46,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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] and [834] $Ultimate##0-->L980-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_285| |v_~#m~0.base_146|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_47| |v_~#queue~0.base_152|) (not (= (mod v_~enqueue_flag~0_139 256) 0)) (= |v_t1Thread1of1ForFork0_~i~0#1_187| 0) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_337| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_47|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_53| 2147483648)) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_53| 2147483647) (= (store |v_#pthreadsMutex_285| |v_~#m~0.base_146| (store .cse0 |v_~#m~0.offset_146| 1)) |v_#pthreadsMutex_284|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_47| |v_~#queue~0.offset_147|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_98| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_46| |v_t1Thread1of1ForFork0_~arg#1.offset_49|) (= (select .cse0 |v_~#m~0.offset_146|) 0) (= |v_t1Thread1of1ForFork0_~value~0#1_118| |v_t1Thread1of1ForFork0_#t~nondet51#1_53|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| (select (select |v_#memory_int_1089| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_337|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_337|))) (= |v_t1Thread1of1ForFork0_~value~0#1_118| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|) (= |v_t1Thread1of1ForFork0_~arg#1.base_49| |v_t1Thread1of1ForFork0_#in~arg#1.base_46|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_47| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_337|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_285|, ~#m~0.base=|v_~#m~0.base_146|, ~#queue~0.base=|v_~#queue~0.base_152|, ~enqueue_flag~0=v_~enqueue_flag~0_139, ~#m~0.offset=|v_~#m~0.offset_146|, #memory_int=|v_#memory_int_1089|, ~#queue~0.offset=|v_~#queue~0.offset_147|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_53|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_46|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_46|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_187|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_49|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_337|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_118|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_47|, ~#queue~0.base=|v_~#queue~0.base_152|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_337|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_151|, ~#queue~0.offset=|v_~#queue~0.offset_147|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_49|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_102|, #pthreadsMutex=|v_#pthreadsMutex_284|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_107|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_46|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|, ~#m~0.base=|v_~#m~0.base_146|, ~enqueue_flag~0=v_~enqueue_flag~0_139, ~#m~0.offset=|v_~#m~0.offset_146|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_73|, #memory_int=|v_#memory_int_1089|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_98|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_47|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_46|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_117|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-05 22:50:46,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] $Ultimate##0-->L1011-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_264| |v_~#m~0.base_140|))) (and (= (store |v_#pthreadsMutex_264| |v_~#m~0.base_140| (store .cse0 |v_~#m~0.offset_140| 1)) |v_#pthreadsMutex_263|) (= (select .cse0 |v_~#m~0.offset_140|) 0) (= |v_t1Thread1of1ForFork0_~arg#1.base_43| |v_t1Thread1of1ForFork0_#in~arg#1.base_43|) (= |v_t1Thread1of1ForFork0_~i~0#1_115| 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_43| |v_t1Thread1of1ForFork0_~arg#1.offset_43|) (not (= (mod v_~enqueue_flag~0_130 256) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_264|, ~#m~0.base=|v_~#m~0.base_140|, ~enqueue_flag~0=v_~enqueue_flag~0_130, ~#m~0.offset=|v_~#m~0.offset_140|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_43|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_43|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_263|, ~#m~0.base=|v_~#m~0.base_140|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_115|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_43|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_83|, ~enqueue_flag~0=v_~enqueue_flag~0_130, ~#m~0.offset=|v_~#m~0.offset_140|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_65|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_43|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_43|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_43|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_~arg#1.base] and [835] L1052-4-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_339|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_339| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|) (= (+ |v_#pthreadsForks_159| 1) |v_#pthreadsForks_158|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_~#queue~0.offset_149|) (= |v_t1Thread1of1ForFork0_~value~0#1_122| |v_t1Thread1of1ForFork0_#t~nondet51#1_57|) (= |v_#memory_int_1091| (store |v_#memory_int_1092| |v_ULTIMATE.start_main_~#id2~0#1.base_116| (store (select |v_#memory_int_1092| |v_ULTIMATE.start_main_~#id2~0#1.base_116|) |v_ULTIMATE.start_main_~#id2~0#1.offset_116| |v_ULTIMATE.start_main_#t~pre61#1_124|))) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49| |v_~#queue~0.base_154|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_100| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|) (= |v_t1Thread1of1ForFork0_~value~0#1_122| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| (select (select |v_#memory_int_1091| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_339|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_339|))) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_57| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_57| 2147483648)) (= |v_ULTIMATE.start_main_#t~pre61#1_124| |v_#pthreadsForks_159|) (< |v_t1Thread1of1ForFork0_~i~0#1_189| 20)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_116|, ~#queue~0.base=|v_~#queue~0.base_154|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_189|, #pthreadsForks=|v_#pthreadsForks_159|, #memory_int=|v_#memory_int_1092|, ~#queue~0.offset=|v_~#queue~0.offset_149|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_57|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_116|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_189|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_339|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_122|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|, ~#queue~0.base=|v_~#queue~0.base_154|, #pthreadsForks=|v_#pthreadsForks_158|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_339|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_99|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_153|, ~#queue~0.offset=|v_~#queue~0.offset_149|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_104|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_117|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_116|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_109|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|, ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_124|, #memory_int=|v_#memory_int_1091|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_100|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_116|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_119|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, ULTIMATE.start_main_#t~nondet60#1, t1Thread1of1ForFork0_enqueue_#res#1, #memory_int, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, ULTIMATE.start_main_#t~pre59#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-05 22:50:46,924 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:50:46,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 785 [2022-12-05 22:50:46,924 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 139 transitions, 1033 flow [2022-12-05 22:50:46,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:46,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:46,925 INFO L213 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:46,931 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-05 22:50:47,130 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-05 22:50:47,131 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-05 22:50:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1820300658, now seen corresponding path program 1 times [2022-12-05 22:50:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:47,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34517310] [2022-12-05 22:50:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34517310] [2022-12-05 22:50:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34517310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581434885] [2022-12-05 22:50:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:47,451 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-05 22:50:47,452 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-05 22:50:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:47,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 22:50:47,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:47,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:47,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581434885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:47,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:47,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2022-12-05 22:50:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861242707] [2022-12-05 22:50:47,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:47,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:50:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:50:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-12-05 22:50:47,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-05 22:50:47,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 139 transitions, 1033 flow. Second operand has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 23 states have internal predecessors, (178), 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-05 22:50:47,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:47,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-05 22:50:47,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:48,470 INFO L130 PetriNetUnfolder]: 926/2326 cut-off events. [2022-12-05 22:50:48,470 INFO L131 PetriNetUnfolder]: For 23178/23178 co-relation queries the response was YES. [2022-12-05 22:50:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10369 conditions, 2326 events. 926/2326 cut-off events. For 23178/23178 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 8550 event pairs, 42 based on Foata normal form. 72/2361 useless extension candidates. Maximal degree in co-relation 4823. Up to 330 conditions per place. [2022-12-05 22:50:48,485 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 316 selfloop transitions, 45 changer transitions 1/364 dead transitions. [2022-12-05 22:50:48,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 364 transitions, 4242 flow [2022-12-05 22:50:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:50:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:50:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 293 transitions. [2022-12-05 22:50:48,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44393939393939397 [2022-12-05 22:50:48,487 INFO L175 Difference]: Start difference. First operand has 119 places, 139 transitions, 1033 flow. Second operand 22 states and 293 transitions. [2022-12-05 22:50:48,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 364 transitions, 4242 flow [2022-12-05 22:50:48,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 364 transitions, 4102 flow, removed 12 selfloop flow, removed 12 redundant places. [2022-12-05 22:50:48,513 INFO L231 Difference]: Finished difference. Result has 138 places, 156 transitions, 1284 flow [2022-12-05 22:50:48,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1284, PETRI_PLACES=138, PETRI_TRANSITIONS=156} [2022-12-05 22:50:48,514 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 92 predicate places. [2022-12-05 22:50:48,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:48,514 INFO L89 Accepts]: Start accepts. Operand has 138 places, 156 transitions, 1284 flow [2022-12-05 22:50:48,520 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:48,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:48,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 156 transitions, 1284 flow [2022-12-05 22:50:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 156 transitions, 1284 flow [2022-12-05 22:50:48,606 INFO L130 PetriNetUnfolder]: 162/848 cut-off events. [2022-12-05 22:50:48,606 INFO L131 PetriNetUnfolder]: For 9352/9352 co-relation queries the response was YES. [2022-12-05 22:50:48,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 848 events. 162/848 cut-off events. For 9352/9352 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2515 event pairs, 0 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 3257. Up to 168 conditions per place. [2022-12-05 22:50:48,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 156 transitions, 1284 flow [2022-12-05 22:50:48,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-05 22:50:48,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:50:48,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-05 22:50:48,635 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 156 transitions, 1284 flow [2022-12-05 22:50:48,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 23 states have internal predecessors, (178), 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-05 22:50:48,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:48,635 INFO L213 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:48,655 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-05 22:50:48,841 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-05 22:50:48,841 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-05 22:50:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1626580383, now seen corresponding path program 2 times [2022-12-05 22:50:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:48,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982040985] [2022-12-05 22:50:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 416 proven. 15 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2022-12-05 22:50:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:50,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982040985] [2022-12-05 22:50:50,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982040985] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:50,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782838193] [2022-12-05 22:50:50,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:50:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:50,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:50,989 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-05 22:50:50,990 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-05 22:50:51,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:50:51,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:50:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-05 22:50:51,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:51,772 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-05 22:50:51,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:51,791 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-05 22:50:51,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:51,841 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:50:51,841 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-05 22:50:51,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:51,875 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-05 22:50:51,915 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-05 22:50:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:51,933 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-05 22:50:51,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:51,988 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:50:51,989 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-05 22:50:52,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:52,017 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-05 22:50:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 264 proven. 95 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2022-12-05 22:50:52,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:52,129 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1231 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 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_1229) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1231) .cse1)))))) is different from false [2022-12-05 22:50:52,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1231 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 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_1229) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1231) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| (select .cse0 .cse1)))))) is different from false [2022-12-05 22:50:52,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1231 Int) (v_ArrVal_1225 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 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_1225) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1229) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1231) .cse1) 20))))) is different from false [2022-12-05 22:50:52,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1231 Int) (v_ArrVal_1223 Int) (v_ArrVal_1225 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 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_1223)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1225) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1229) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1231) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_173| (select .cse0 .cse1)))))) is different from false [2022-12-05 22:50:52,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:50:52,281 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-05 22:50:52,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:50:52,289 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-05 22:50:52,294 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 253 treesize of output 237 [2022-12-05 22:50:52,298 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 263 [2022-12-05 22:50:52,309 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-05 22:50:52,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:50:52,363 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 97 treesize of output 89 [2022-12-05 22:50:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 174 proven. 90 refuted. 1 times theorem prover too weak. 916 trivial. 94 not checked. [2022-12-05 22:50:52,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782838193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:52,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:52,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 34 [2022-12-05 22:50:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837423202] [2022-12-05 22:50:52,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:52,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-05 22:50:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-05 22:50:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=738, Unknown=11, NotChecked=244, Total=1190 [2022-12-05 22:50:52,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:50:52,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 156 transitions, 1284 flow. Second operand has 35 states, 35 states have (on average 3.257142857142857) internal successors, (114), 34 states have internal predecessors, (114), 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-05 22:50:52,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:52,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:50:52,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:54,734 INFO L130 PetriNetUnfolder]: 2228/5043 cut-off events. [2022-12-05 22:50:54,734 INFO L131 PetriNetUnfolder]: For 61617/61617 co-relation queries the response was YES. [2022-12-05 22:50:54,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24627 conditions, 5043 events. 2228/5043 cut-off events. For 61617/61617 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 23208 event pairs, 100 based on Foata normal form. 138/5100 useless extension candidates. Maximal degree in co-relation 21865. Up to 1779 conditions per place. [2022-12-05 22:50:54,767 INFO L137 encePairwiseOnDemand]: 13/29 looper letters, 193 selfloop transitions, 169 changer transitions 0/362 dead transitions. [2022-12-05 22:50:54,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 362 transitions, 3413 flow [2022-12-05 22:50:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:50:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:50:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2022-12-05 22:50:54,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29817444219066935 [2022-12-05 22:50:54,769 INFO L175 Difference]: Start difference. First operand has 137 places, 156 transitions, 1284 flow. Second operand 17 states and 147 transitions. [2022-12-05 22:50:54,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 362 transitions, 3413 flow [2022-12-05 22:50:54,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 362 transitions, 3319 flow, removed 4 selfloop flow, removed 12 redundant places. [2022-12-05 22:50:54,839 INFO L231 Difference]: Finished difference. Result has 147 places, 248 transitions, 2450 flow [2022-12-05 22:50:54,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2450, PETRI_PLACES=147, PETRI_TRANSITIONS=248} [2022-12-05 22:50:54,840 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 101 predicate places. [2022-12-05 22:50:54,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:54,840 INFO L89 Accepts]: Start accepts. Operand has 147 places, 248 transitions, 2450 flow [2022-12-05 22:50:54,848 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:54,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:54,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 248 transitions, 2450 flow [2022-12-05 22:50:54,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 248 transitions, 2450 flow [2022-12-05 22:50:55,241 INFO L130 PetriNetUnfolder]: 600/3042 cut-off events. [2022-12-05 22:50:55,242 INFO L131 PetriNetUnfolder]: For 54365/54365 co-relation queries the response was YES. [2022-12-05 22:50:55,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17390 conditions, 3042 events. 600/3042 cut-off events. For 54365/54365 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 18107 event pairs, 12 based on Foata normal form. 0/2979 useless extension candidates. Maximal degree in co-relation 15473. Up to 701 conditions per place. [2022-12-05 22:50:55,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 248 transitions, 2450 flow [2022-12-05 22:50:55,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-05 22:50:55,349 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,367 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,388 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,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 [802] L1053-4-->L1054-1: Formula: (= |v_ULTIMATE.start_main_#t~mem63#1_30| (select (select |v_#memory_int_552| |v_ULTIMATE.start_main_~#id1~0#1.base_39|) |v_ULTIMATE.start_main_~#id1~0#1.offset_39|)) InVars {#memory_int=|v_#memory_int_552|, 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_41|, #memory_int=|v_#memory_int_552|, 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-05 22:50:55,416 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,435 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,483 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,502 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,536 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:50:55,573 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:50:55,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-05 22:50:55,574 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 248 transitions, 2483 flow [2022-12-05 22:50:55,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.257142857142857) internal successors, (114), 34 states have internal predecessors, (114), 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-05 22:50:55,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:55,574 INFO L213 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 14, 13, 13, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:55,582 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-05 22:50:55,774 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-05 22:50:55,775 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-05 22:50:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -917034611, now seen corresponding path program 1 times [2022-12-05 22:50:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:55,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431628155] [2022-12-05 22:50:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 500 proven. 44 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2022-12-05 22:50:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431628155] [2022-12-05 22:50:58,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431628155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643644234] [2022-12-05 22:50:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:58,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:58,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:58,418 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-05 22:50:58,419 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-05 22:50:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:58,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 93 conjunts are in the unsatisfiable core [2022-12-05 22:50:58,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:59,119 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-05 22:50:59,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,137 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-05 22:50:59,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:59,176 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:50:59,177 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-05 22:50:59,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,212 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-05 22:50:59,255 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-05 22:50:59,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,276 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-05 22:50:59,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:59,322 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:50:59,322 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-05 22:50:59,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,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 23 treesize of output 22 [2022-12-05 22:50:59,400 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-05 22:50:59,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,422 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-05 22:50:59,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:59,470 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:50:59,470 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-05 22:50:59,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,508 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-05 22:50:59,557 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-05 22:50:59,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:50:59,579 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-05 22:50:59,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:50:59,623 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-05 22:50:59,624 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 32 treesize of output 27 [2022-12-05 22:50:59,648 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-05 22:50:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 467 proven. 121 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2022-12-05 22:50:59,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:59,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1)))))) is different from false [2022-12-05 22:50:59,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 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_1651) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1)))))) is different from false [2022-12-05 22:50:59,758 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1647 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_1647) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20))))) is different from false [2022-12-05 22:50:59,774 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 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_1645)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1647) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse0 .cse1)))))) is different from false [2022-12-05 22:51:00,504 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1647) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 .cse1))) (not (= 20 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse2 .cse1)))))))) is different from false [2022-12-05 22:51:00,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (let ((.cse3 (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_1644))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1647) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 .cse1))) (not (= 20 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse2 .cse1)))))))) is different from false [2022-12-05 22:51:00,623 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1641 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (let ((.cse3 (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_1641) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1647) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse0 .cse1)))))))) is different from false [2022-12-05 22:51:00,655 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1641 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (let ((.cse3 (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_1638)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1641) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1647) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse0 .cse1)))))))) is different from false [2022-12-05 22:51:00,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1638 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (v_ArrVal_1644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1641 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1637))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (store (store .cse8 .cse6 v_ArrVal_1641) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse5 .cse6 v_ArrVal_1647) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse3 .cse1)))))))))) is different from false [2022-12-05 22:51:01,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1653 Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 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_1633) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1637))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (store (store .cse8 .cse6 v_ArrVal_1641) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse5 .cse6 v_ArrVal_1647) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse2 .cse1)))))))))) is different from false [2022-12-05 22:51:01,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1653 Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1632 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 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_1632)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1633) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1637))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (store (store .cse8 .cse6 v_ArrVal_1641) .cse1 (+ 1 (select .cse8 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse5 .cse6 v_ArrVal_1647) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse3 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20))))))))) is different from false [2022-12-05 22:51:01,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_1653 Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_238| Int) (v_ArrVal_1632 Int) (v_ArrVal_1645 Int) (v_ArrVal_1647 Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1630))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_238| 4)) v_ArrVal_1632))) (store (store .cse11 .cse7 v_ArrVal_1633) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1637))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (store (store .cse9 .cse7 v_ArrVal_1641) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1644))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_1645))) (store (store .cse6 .cse7 v_ArrVal_1647) .cse1 (+ 1 (select .cse6 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1651) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_238| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| (select .cse4 .cse1))) (not (= (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_232| 4)) v_ArrVal_1653) .cse1) 20))))))))))) is different from false [2022-12-05 22:51:01,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:51:01,355 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 2169 treesize of output 1509 [2022-12-05 22:51:01,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:51:01,382 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 2079 treesize of output 2053 [2022-12-05 22:51:01,404 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 2077 treesize of output 2057 [2022-12-05 22:51:01,422 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 1805 treesize of output 1741 [2022-12-05 22:51:01,439 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 2018 treesize of output 1970 [2022-12-05 22:51:01,456 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 2005 treesize of output 1973 [2022-12-05 22:51:01,494 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-05 22:51:01,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:51:01,696 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 262 treesize of output 246 [2022-12-05 22:51:01,882 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 22:51:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 224 proven. 91 refuted. 1 times theorem prover too weak. 736 trivial. 272 not checked. [2022-12-05 22:51:02,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643644234] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:51:02,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:51:02,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 25] total 60 [2022-12-05 22:51:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534982206] [2022-12-05 22:51:02,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:51:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-05 22:51:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:51:02,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-05 22:51:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1773, Unknown=28, NotChecked=1260, Total=3660 [2022-12-05 22:51:02,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-05 22:51:02,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 248 transitions, 2483 flow. Second operand has 61 states, 61 states have (on average 2.540983606557377) internal successors, (155), 60 states have internal predecessors, (155), 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-05 22:51:02,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:51:02,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-05 22:51:02,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:51:14,063 INFO L130 PetriNetUnfolder]: 4851/11433 cut-off events. [2022-12-05 22:51:14,063 INFO L131 PetriNetUnfolder]: For 206370/206370 co-relation queries the response was YES. [2022-12-05 22:51:14,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68931 conditions, 11433 events. 4851/11433 cut-off events. For 206370/206370 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 70685 event pairs, 310 based on Foata normal form. 332/11532 useless extension candidates. Maximal degree in co-relation 59837. Up to 3723 conditions per place. [2022-12-05 22:51:14,150 INFO L137 encePairwiseOnDemand]: 21/41 looper letters, 401 selfloop transitions, 262 changer transitions 0/663 dead transitions. [2022-12-05 22:51:14,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 663 transitions, 7989 flow [2022-12-05 22:51:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-05 22:51:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-05 22:51:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 338 transitions. [2022-12-05 22:51:14,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19628339140534262 [2022-12-05 22:51:14,153 INFO L175 Difference]: Start difference. First operand has 147 places, 248 transitions, 2483 flow. Second operand 42 states and 338 transitions. [2022-12-05 22:51:14,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 663 transitions, 7989 flow [2022-12-05 22:51:14,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 663 transitions, 7094 flow, removed 414 selfloop flow, removed 16 redundant places. [2022-12-05 22:51:14,432 INFO L231 Difference]: Finished difference. Result has 184 places, 341 transitions, 3954 flow [2022-12-05 22:51:14,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3954, PETRI_PLACES=184, PETRI_TRANSITIONS=341} [2022-12-05 22:51:14,434 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 138 predicate places. [2022-12-05 22:51:14,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:51:14,434 INFO L89 Accepts]: Start accepts. Operand has 184 places, 341 transitions, 3954 flow [2022-12-05 22:51:14,444 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:51:14,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:51:14,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 341 transitions, 3954 flow [2022-12-05 22:51:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 341 transitions, 3954 flow [2022-12-05 22:51:15,524 INFO L130 PetriNetUnfolder]: 1197/6906 cut-off events. [2022-12-05 22:51:15,525 INFO L131 PetriNetUnfolder]: For 52835/52878 co-relation queries the response was YES. [2022-12-05 22:51:15,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33440 conditions, 6906 events. 1197/6906 cut-off events. For 52835/52878 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 57553 event pairs, 37 based on Foata normal form. 0/6666 useless extension candidates. Maximal degree in co-relation 28635. Up to 2007 conditions per place. [2022-12-05 22:51:15,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 341 transitions, 3954 flow [2022-12-05 22:51:15,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-05 22:51:15,609 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:15,738 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:15,756 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:15,823 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:15,908 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:15,928 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:15,982 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:16,008 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:16,045 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:16,065 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:16,085 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 [763] 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_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |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_388|)) 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_389|, 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_388|, 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-05 22:51:16,213 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 22:51:16,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1780 [2022-12-05 22:51:16,214 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 340 transitions, 4018 flow [2022-12-05 22:51:16,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.540983606557377) internal successors, (155), 60 states have internal predecessors, (155), 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-05 22:51:16,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:51:16,214 INFO L213 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 17, 15, 15, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:51:16,220 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-05 22:51:16,418 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-05 22:51:16,419 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-05 22:51:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:51:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1094838389, now seen corresponding path program 1 times [2022-12-05 22:51:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:51:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742978127] [2022-12-05 22:51:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:51:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 760 proven. 269 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-12-05 22:51:23,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:51:23,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742978127] [2022-12-05 22:51:23,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742978127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:51:23,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596711312] [2022-12-05 22:51:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:23,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:51:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:51:23,835 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-05 22:51:23,836 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-05 22:51:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:24,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 204 conjunts are in the unsatisfiable core [2022-12-05 22:51:24,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:51:24,513 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-05 22:51:24,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:24,531 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-05 22:51:24,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:24,579 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:24,580 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-05 22:51:24,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:24,617 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-05 22:51:24,638 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 34 treesize of output 18 [2022-12-05 22:51:24,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:24,658 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-05 22:51:24,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:24,712 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:24,713 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-05 22:51:24,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:24,756 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-05 22:51:24,819 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 34 treesize of output 18 [2022-12-05 22:51:24,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:24,841 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-05 22:51:24,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:24,902 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:24,902 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-05 22:51:24,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:24,946 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-05 22:51:25,001 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-05 22:51:25,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,027 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-05 22:51:25,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:25,073 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-05 22:51:25,073 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-05 22:51:25,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,125 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-05 22:51:25,181 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 34 treesize of output 18 [2022-12-05 22:51:25,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,200 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-05 22:51:25,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:25,252 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:25,253 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-05 22:51:25,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,322 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-05 22:51:25,380 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 34 treesize of output 18 [2022-12-05 22:51:25,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,406 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-05 22:51:25,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:25,463 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:25,463 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-05 22:51:25,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,508 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-05 22:51:25,569 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 34 treesize of output 18 [2022-12-05 22:51:25,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,595 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-05 22:51:25,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:25,661 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:25,662 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-05 22:51:25,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,709 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-05 22:51:25,770 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 34 treesize of output 18 [2022-12-05 22:51:25,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,793 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-05 22:51:25,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:25,848 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:25,848 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-05 22:51:25,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,905 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-05 22:51:25,967 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 34 treesize of output 18 [2022-12-05 22:51:25,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:25,993 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-05 22:51:26,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:26,058 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-05 22:51:26,058 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-05 22:51:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:26,106 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-05 22:51:26,177 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 34 treesize of output 18 [2022-12-05 22:51:26,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 22:51:26,205 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-05 22:51:26,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 22:51:26,256 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-05 22:51:26,256 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-05 22:51:26,291 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-05 22:51:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 736 proven. 383 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-12-05 22:51:26,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:51:26,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2116 Int)) (or (not (<= v_ArrVal_2113 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (not (<= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (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|) v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2116)) .cse1)))))) is different from false [2022-12-05 22:51:26,501 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_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2116 Int)) (or (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 .cse3 .cse4 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2116)) .cse2)))) (< (+ .cse0 1) v_ArrVal_2113)))))) is different from false [2022-12-05 22:51:26,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int)) (or (not (<= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2112) .cse3 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1)))) (< (+ .cse4 1) v_ArrVal_2113))) (= .cse4 20)))) is different from false [2022-12-05 22:51:26,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2112 Int) (v_ArrVal_2116 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_2110)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (< (+ .cse0 1) v_ArrVal_2113) (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_2112) .cse4 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2)))) (= .cse0 20))))) is different from false [2022-12-05 22:51:32,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2112 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse2 (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|) v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (<= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (not (<= v_ArrVal_2106 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (= .cse4 20) (< (+ .cse4 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse5 .cse1))))))))) is different from false [2022-12-05 22:51:34,856 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 ((.cse4 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2112 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse3 .cse1))) (or (not (<= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (< (+ .cse4 1) v_ArrVal_2106) (= .cse5 20) (< (+ .cse5 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse6 .cse1))))))))) (= .cse4 20)))) is different from false [2022-12-05 22:51:35,046 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 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_2103)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2104) .cse8 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select .cse4 .cse2)) (.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (not (<= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse5 .cse2))) (= 20 .cse6) (< (+ .cse6 1) v_ArrVal_2113) (< (+ .cse0 1) v_ArrVal_2106)))))))) is different from false [2022-12-05 22:51:41,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse10 (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|) v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse0 (select .cse9 .cse2)) (.cse8 (select .cse5 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse1 .cse2))) (not (<= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse7 .cse2))) (not (<= v_ArrVal_2099 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (= 20 .cse8) (< (+ .cse0 1) v_ArrVal_2106) (< (+ .cse8 1) v_ArrVal_2113)))))))))) is different from false [2022-12-05 22:51:41,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse0 (select .cse11 .cse2)) (.cse10 (select .cse5 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse1 .cse2))) (not (<= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse7 .cse2))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_2099) (= 20 .cse10) (< (+ .cse0 1) v_ArrVal_2106) (< (+ .cse10 1) v_ArrVal_2113))))))))))) is different from false [2022-12-05 22:51:41,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2097 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2097) .cse10 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse6 (select .cse4 .cse1)) (.cse8 (select .cse11 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse0 .cse1))) (not (<= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (< (+ .cse6 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse7 .cse1))) (= 20 .cse6) (< (+ .cse8 1) v_ArrVal_2106) (< (+ (select .cse9 .cse10) 1) v_ArrVal_2099) (= .cse8 20))))))))))) is different from false [2022-12-05 22:51:41,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2097 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse0 (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_2095)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse10 v_ArrVal_2104) .cse3 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse5 (select .cse9 .cse3)) (.cse6 (select .cse11 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse4 .cse3))) (= .cse5 20) (< (+ .cse5 1) v_ArrVal_2113) (< (+ .cse6 1) v_ArrVal_2106) (= .cse6 20) (not (<= 20 (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2112) .cse3 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse3))))))))))))) is different from false [2022-12-05 22:51:58,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2093 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2097 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse13 (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|) v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse3 (select .cse11 .cse1)) (.cse2 (select .cse8 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_2113) (< (+ .cse3 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse4 .cse1))) (not (<= v_ArrVal_2093 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (= .cse3 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2099) (not (<= 20 (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse1))) v_ArrVal_2116)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse10 .cse1))) (= .cse2 20))))))))))))) is different from false [2022-12-05 22:51:58,811 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2093 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2097 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse0 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse9 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse11 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse3 (select .cse13 .cse1)) (.cse2 (select .cse10 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_2113) (< (+ .cse3 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2093) (= .cse3 20) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2099) (not (<= 20 (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) v_ArrVal_2116)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse12 .cse1))) (= .cse2 20)))))))))))))) is different from false [2022-12-05 22:51:59,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2091 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2093 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2097 Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 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_2088)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2091) .cse8 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse9 (select .cse15 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_2097) .cse2 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse4 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse12 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse0 (select .cse5 .cse2)) (.cse11 (select .cse13 .cse2))) (or (< (+ .cse0 1) v_ArrVal_2113) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2099) (not (<= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_2116)) .cse2))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse9 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse10 .cse2))) (= .cse0 20) (< (+ .cse11 1) v_ArrVal_2106) (= .cse11 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse12 .cse2)))))))))))))))) is different from false [2022-12-05 22:52:20,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (v_ArrVal_2091 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2093 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2097 Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2112 Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int) (v_ArrVal_2116 Int)) (let ((.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|) v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse3 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse11 v_ArrVal_2091) .cse2 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse5 (select .cse15 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse1 .cse11 v_ArrVal_2097) .cse2 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse9 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse11 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse4 (select .cse13 .cse2)) (.cse0 (select .cse10 .cse2))) (or (= 20 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse3 .cse2))) (= 20 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse6 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse7 .cse2))) (not (<= 20 (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (< (+ .cse4 1) v_ArrVal_2106) (< (+ .cse0 1) v_ArrVal_2113) (< (+ (select .cse12 .cse2) 1) v_ArrVal_2093) (not (<= v_ArrVal_2086 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))))))))))))))))) is different from false [2022-12-05 22:52:33,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse18 .cse19))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (v_ArrVal_2097 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2084) .cse19 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse4 (select .cse17 |c_~#queue~0.base|))) (let ((.cse13 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_2091) .cse3 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse11 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2097) .cse3 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (let ((.cse14 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse7 (store (store .cse15 |c_~#queue~0.base| (store (store .cse14 .cse9 v_ArrVal_2104) .cse3 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse12 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse1 (select .cse8 .cse3)) (.cse0 (select .cse14 .cse3))) (or (< (+ .cse0 1) v_ArrVal_2106) (= .cse1 20) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_2086) (not (<= 20 (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2112) .cse3 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_2116)) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse10 .cse3))) (< (+ .cse1 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse11 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse12 .cse3))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2093) (= .cse0 20)))))))))))))))) (= .cse5 20)))) is different from false [2022-12-05 22:52:33,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (v_ArrVal_2097 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse14 (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_2082)) (.cse15 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2084) .cse15 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse12 (select .cse19 |c_~#queue~0.base|))) (let ((.cse3 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_2091) .cse4 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse11 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse11 .cse10 v_ArrVal_2097) .cse4 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse13 (select .cse17 |c_~#queue~0.base|))) (let ((.cse16 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse8 (store (store .cse17 |c_~#queue~0.base| (store (store .cse16 .cse10 v_ArrVal_2104) .cse4 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse0 (select .cse16 .cse4)) (.cse1 (select .cse14 .cse15)) (.cse2 (select .cse9 .cse4))) (or (< (+ .cse0 1) v_ArrVal_2106) (= .cse1 20) (= .cse2 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse5 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse6 .cse4))) (not (<= 20 (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2112) .cse4 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_2116)) .cse4))) (< (+ (select .cse11 .cse4) 1) v_ArrVal_2099) (= .cse0 20) (< (+ .cse1 1) v_ArrVal_2086) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse12 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse13 .cse4))) (< (+ .cse2 1) v_ArrVal_2113))))))))))))))))) is different from false [2022-12-05 22:52:46,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse16 (select .cse22 |c_~#queue~0.base|))) (let ((.cse18 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse18 .cse10 v_ArrVal_2084) .cse1 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse0 (select .cse21 |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse11 .cse10 v_ArrVal_2091) .cse1 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse14 (select .cse20 |c_~#queue~0.base|))) (let ((.cse15 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse15 .cse10 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse2 (select .cse19 |c_~#queue~0.base|))) (let ((.cse17 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse8 (store (store .cse19 |c_~#queue~0.base| (store (store .cse17 .cse10 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse12 (select .cse9 .cse1)) (.cse6 (select .cse18 .cse1)) (.cse13 (select .cse17 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse5 .cse1))) (= 20 .cse6) (not (<= 20 (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2093) (= .cse12 20) (< (+ .cse13 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse14 .cse1))) (< (+ (select .cse15 .cse1) 1) v_ArrVal_2099) (< (+ .cse12 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse16 .cse1))) (< (+ .cse6 1) v_ArrVal_2086) (= 20 .cse13)))))))))))))))))))) is different from false [2022-12-05 22:52:46,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2077) .cse4 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse9 (select .cse22 |c_~#queue~0.base|))) (let ((.cse17 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse17 .cse13 v_ArrVal_2084) .cse2 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse6 (select .cse21 |c_~#queue~0.base|))) (let ((.cse14 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse14 .cse13 v_ArrVal_2091) .cse2 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse5 (select .cse20 |c_~#queue~0.base|))) (let ((.cse15 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse15 .cse13 v_ArrVal_2097) .cse2 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse16 (select .cse19 |c_~#queue~0.base|))) (let ((.cse18 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse11 (store (store .cse19 |c_~#queue~0.base| (store (store .cse18 .cse13 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse1 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse0 (select .cse18 .cse2)) (.cse8 (select .cse12 .cse2)) (.cse7 (select .cse17 .cse2))) (or (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse6 .cse2))) (= .cse7 20) (< (+ .cse0 1) v_ArrVal_2106) (< (+ .cse8 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse9 .cse2))) (= .cse8 20) (not (<= 20 (select (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse13 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (< (+ (select .cse14 .cse2) 1) v_ArrVal_2093) (< (+ .cse7 1) v_ArrVal_2086) (< (+ (select .cse15 .cse2) 1) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse16 .cse2)))))))))))))))))))))) is different from false [2022-12-05 22:52:46,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 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_2075)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2077) .cse8 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse14 (select .cse22 |c_~#queue~0.base|))) (let ((.cse18 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_2084) .cse1 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse5 (select .cse21 |c_~#queue~0.base|))) (let ((.cse9 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2091) .cse1 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse15 (select .cse20 |c_~#queue~0.base|))) (let ((.cse13 (store .cse15 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse10 (select .cse19 |c_~#queue~0.base|))) (let ((.cse17 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse2 (store (store .cse19 |c_~#queue~0.base| (store (store .cse17 .cse4 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse16 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse11 (select .cse18 .cse1)) (.cse6 (select .cse17 .cse1)) (.cse12 (select .cse3 .cse1))) (or (not (<= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2116)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse5 .cse1))) (< (+ .cse6 1) v_ArrVal_2106) (< (+ (select .cse7 .cse8) 1) v_ArrVal_2078) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse10 .cse1))) (< (+ .cse11 1) v_ArrVal_2086) (= 20 .cse12) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse14 .cse1))) (= .cse11 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse15 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse16 .cse1))) (= .cse6 20) (< (+ .cse12 1) v_ArrVal_2113)))))))))))))))))))) is different from false [2022-12-05 22:53:12,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse9 (let ((.cse23 (select .cse22 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2075))) (.cse14 (+ 88 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse9 .cse14 v_ArrVal_2077) .cse2 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse4 (select .cse21 |c_~#queue~0.base|))) (let ((.cse17 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse17 .cse14 v_ArrVal_2084) .cse2 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse6 (select .cse20 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse3 .cse14 v_ArrVal_2091) .cse2 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse7 (select .cse19 |c_~#queue~0.base|))) (let ((.cse15 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse15 .cse14 v_ArrVal_2097) .cse2 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse1 (select .cse18 |c_~#queue~0.base|))) (let ((.cse16 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse12 (store (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse14 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse13 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse8 (select .cse17 .cse2)) (.cse10 (select .cse13 .cse2)) (.cse0 (select .cse16 .cse2))) (or (< (+ .cse0 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse6 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse7 .cse2))) (= .cse8 20) (< (+ (select .cse9 .cse2) 1) v_ArrVal_2078) (= .cse10 20) (not (<= 20 (select (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse14 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (< (+ (select .cse15 .cse2) 1) v_ArrVal_2099) (< (+ .cse8 1) v_ArrVal_2086) (< (+ .cse10 1) v_ArrVal_2113) (= .cse0 20))))))))))))))))))))) is different from false [2022-12-05 22:53:21,144 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 ((.cse26 (select .cse24 .cse25))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2069) .cse25 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse1 (let ((.cse23 (select .cse22 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2075))) (.cse13 (+ 88 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse1 .cse13 v_ArrVal_2077) .cse2 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse4 (select .cse21 |c_~#queue~0.base|))) (let ((.cse17 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse17 .cse13 v_ArrVal_2084) .cse2 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse3 (select .cse20 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse8 .cse13 v_ArrVal_2091) .cse2 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse15 (select .cse19 |c_~#queue~0.base|))) (let ((.cse9 (store .cse15 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse9 .cse13 v_ArrVal_2097) .cse2 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse14 (select .cse18 |c_~#queue~0.base|))) (let ((.cse16 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse11 (store (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse13 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse5 (select .cse17 .cse2)) (.cse7 (select .cse16 .cse2)) (.cse0 (select .cse12 .cse2))) (or (= .cse0 20) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse4 .cse2))) (< (+ .cse5 1) v_ArrVal_2086) (= 20 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse6 .cse2))) (= .cse7 20) (< (+ (select .cse8 .cse2) 1) v_ArrVal_2093) (< (+ (select .cse9 .cse2) 1) v_ArrVal_2099) (not (<= 20 (select (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse13 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse14 .cse2))) (< (+ .cse7 1) v_ArrVal_2106) (< (+ .cse0 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse15 .cse2))))))))))))))))))))))) (= .cse26 20)))) is different from false [2022-12-05 22:53:21,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2086 Int) (v_ArrVal_2067 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse25 (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_2067)) (.cse26 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (select .cse25 .cse26))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse23 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse25 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2069) .cse26 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse10 (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2075))) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse22 (store (store .cse23 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2077) .cse2 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse11 (select .cse22 |c_~#queue~0.base|))) (let ((.cse18 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2084) .cse2 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse14 (select .cse21 |c_~#queue~0.base|))) (let ((.cse9 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2091) .cse2 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse12 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2097) .cse2 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse16 (select .cse19 |c_~#queue~0.base|))) (let ((.cse17 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse3 (store (store .cse19 |c_~#queue~0.base| (store (store .cse17 .cse5 v_ArrVal_2104) .cse2 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse6 (select .cse4 .cse2)) (.cse8 (select .cse18 .cse2)) (.cse0 (select .cse17 .cse2))) (or (< (+ .cse0 1) v_ArrVal_2106) (not (<= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2112) .cse2 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2116)) .cse2))) (< (+ .cse6 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse7 .cse2))) (= .cse8 20) (< (+ (select .cse9 .cse2) 1) v_ArrVal_2093) (< (+ (select .cse10 .cse2) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse11 .cse2))) (< (+ (select .cse12 .cse2) 1) v_ArrVal_2099) (= .cse6 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse13 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse14 .cse2))) (< (+ .cse8 1) v_ArrVal_2086) (= .cse15 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse16 .cse2))) (= .cse0 20))))))))))))))))))))))) is different from false [2022-12-05 22:53:41,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2063 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2065 Int) (v_ArrVal_2086 Int) (v_ArrVal_2067 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2063) .cse17 v_ArrVal_2065)) |c_~#stored_elements~0.base| v_ArrVal_2066))) (let ((.cse2 (select .cse28 |c_~#queue~0.base|))) (let ((.cse29 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| 4) |c_~#queue~0.offset|) v_ArrVal_2067)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse29 .cse1))) (let ((.cse26 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse7 v_ArrVal_2069) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse0 (let ((.cse27 (select .cse26 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2075)))) (let ((.cse25 (store (store .cse26 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_2077) .cse1 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse14 (select .cse25 |c_~#queue~0.base|))) (let ((.cse21 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse24 (store (store .cse25 |c_~#queue~0.base| (store (store .cse21 .cse7 v_ArrVal_2084) .cse1 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse11 (select .cse24 |c_~#queue~0.base|))) (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse23 (store (store .cse24 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_2091) .cse1 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse8 (select .cse23 |c_~#queue~0.base|))) (let ((.cse18 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse22 (store (store .cse23 |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse19 (select .cse22 |c_~#queue~0.base|))) (let ((.cse20 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse5 (store (store .cse22 |c_~#queue~0.base| (store (store .cse20 .cse7 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse12 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse3 (select .cse21 .cse1)) (.cse9 (select .cse6 .cse1)) (.cse15 (select .cse20 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| (select .cse2 .cse1))) (= 20 .cse3) (< (+ .cse3 1) v_ArrVal_2086) (not (<= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse8 .cse1))) (= .cse9 20) (= .cse10 20) (< (+ .cse9 1) v_ArrVal_2113) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse11 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse12 .cse1))) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse14 .cse1))) (= 20 .cse15) (< (+ (select .cse16 .cse17) 1) v_ArrVal_2065) (< (+ .cse15 1) v_ArrVal_2106) (< (+ (select .cse18 .cse1) 1) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse19 .cse1)))))))))))))))))))))))))))) is different from false [2022-12-05 22:53:42,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2060 Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2063 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2065 Int) (v_ArrVal_2086 Int) (v_ArrVal_2067 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 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_2060)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2063) .cse17 v_ArrVal_2065)) |c_~#stored_elements~0.base| v_ArrVal_2066))) (let ((.cse13 (select .cse28 |c_~#queue~0.base|))) (let ((.cse29 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| 4) |c_~#queue~0.offset|) v_ArrVal_2067)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse29 .cse1))) (let ((.cse26 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse4 v_ArrVal_2069) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse8 (let ((.cse27 (select .cse26 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2075)))) (let ((.cse25 (store (store .cse26 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2077) .cse1 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse5 (select .cse25 |c_~#queue~0.base|))) (let ((.cse20 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse24 (store (store .cse25 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_2084) .cse1 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse14 (select .cse24 |c_~#queue~0.base|))) (let ((.cse10 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse23 (store (store .cse24 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2091) .cse1 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse6 (select .cse23 |c_~#queue~0.base|))) (let ((.cse18 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse22 (store (store .cse23 |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse19 (select .cse22 |c_~#queue~0.base|))) (let ((.cse21 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse2 (store (store .cse22 |c_~#queue~0.base| (store (store .cse21 .cse4 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse12 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse9 (select .cse3 .cse1)) (.cse15 (select .cse21 .cse1)) (.cse11 (select .cse20 .cse1))) (or (not (<= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse6 .cse1))) (= .cse7 20) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2078) (< (+ 1 .cse9) v_ArrVal_2113) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2093) (= .cse11 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse12 .cse1))) (= 20 .cse9) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| (select .cse13 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse14 .cse1))) (= 20 .cse15) (< (+ (select .cse16 .cse17) 1) v_ArrVal_2065) (< (+ .cse15 1) v_ArrVal_2106) (< (+ (select .cse18 .cse1) 1) v_ArrVal_2099) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse19 .cse1))) (< (+ .cse11 1) v_ArrVal_2086)))))))))))))))))))))))))) is different from false [2022-12-05 22:54:27,248 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2059 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2060 Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2063 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2065 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| Int) (v_ArrVal_2067 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse32 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse15 .cse16 v_ArrVal_2058)) |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse21 (select .cse32 |c_~#queue~0.base|))) (let ((.cse17 (store .cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) v_ArrVal_2060)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse30 (store (store .cse32 |c_~#queue~0.base| (store (store .cse17 .cse5 v_ArrVal_2063) .cse1 v_ArrVal_2065)) |c_~#stored_elements~0.base| v_ArrVal_2066))) (let ((.cse0 (select .cse30 |c_~#queue~0.base|))) (let ((.cse31 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| 4) |c_~#queue~0.offset|) v_ArrVal_2067))) (let ((.cse10 (select .cse31 .cse1))) (let ((.cse28 (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse5 v_ArrVal_2069) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse6 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse1) 4)) v_ArrVal_2075)))) (let ((.cse27 (store (store .cse28 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_2077) .cse1 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse7 (select .cse27 |c_~#queue~0.base|))) (let ((.cse22 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse26 (store (store .cse27 |c_~#queue~0.base| (store (store .cse22 .cse5 v_ArrVal_2084) .cse1 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse11 (select .cse26 |c_~#queue~0.base|))) (let ((.cse18 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse25 (store (store .cse26 |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2091) .cse1 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse20 (select .cse25 |c_~#queue~0.base|))) (let ((.cse14 (store .cse20 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse24 (store (store .cse25 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_2097) .cse1 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse12 (select .cse24 |c_~#queue~0.base|))) (let ((.cse23 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse3 (store (store .cse24 |c_~#queue~0.base| (store (store .cse23 .cse5 v_ArrVal_2104) .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse19 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse13 (select .cse23 .cse1)) (.cse8 (select .cse4 .cse1)) (.cse9 (select .cse22 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| (select .cse0 .cse1))) (not (<= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2112) .cse1 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse7 .cse1))) (< (+ .cse8 1) v_ArrVal_2113) (< (+ .cse9 1) v_ArrVal_2086) (= .cse10 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse11 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse12 .cse1))) (= .cse13 20) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2099) (< (+ .cse13 1) v_ArrVal_2106) (not (<= v_ArrVal_2058 (+ (select .cse15 .cse16) 1))) (< (+ (select .cse17 .cse1) 1) v_ArrVal_2065) (< (+ 1 (select .cse18 .cse1)) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse19 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse20 .cse1))) (= 20 .cse8) (= 20 .cse9) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| (select .cse21 .cse1))))))))))))))))))))))))))))))) is different from false [2022-12-05 22:54:27,773 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2056 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2059 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2060 Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2063 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2065 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| Int) (v_ArrVal_2067 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse32 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2056) .cse12 v_ArrVal_2058)) |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse15 (select .cse32 |c_~#queue~0.base|))) (let ((.cse13 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) v_ArrVal_2060)) (.cse19 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse30 (store (store .cse32 |c_~#queue~0.base| (store (store .cse13 .cse19 v_ArrVal_2063) .cse3 v_ArrVal_2065)) |c_~#stored_elements~0.base| v_ArrVal_2066))) (let ((.cse10 (select .cse30 |c_~#queue~0.base|))) (let ((.cse31 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| 4) |c_~#queue~0.offset|) v_ArrVal_2067))) (let ((.cse21 (select .cse31 .cse3))) (let ((.cse28 (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse19 v_ArrVal_2069) .cse3 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse5 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2075)))) (let ((.cse27 (store (store .cse28 |c_~#queue~0.base| (store (store .cse5 .cse19 v_ArrVal_2077) .cse3 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse14 (select .cse27 |c_~#queue~0.base|))) (let ((.cse22 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse26 (store (store .cse27 |c_~#queue~0.base| (store (store .cse22 .cse19 v_ArrVal_2084) .cse3 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse7 (select .cse26 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse25 (store (store .cse26 |c_~#queue~0.base| (store (store .cse4 .cse19 v_ArrVal_2091) .cse3 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse2 (select .cse25 |c_~#queue~0.base|))) (let ((.cse20 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse24 (store (store .cse25 |c_~#queue~0.base| (store (store .cse20 .cse19 v_ArrVal_2097) .cse3 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse6 (select .cse24 |c_~#queue~0.base|))) (let ((.cse23 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse17 (store (store .cse24 |c_~#queue~0.base| (store (store .cse23 .cse19 v_ArrVal_2104) .cse3 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse9 (select .cse17 |c_~#queue~0.base|))) (let ((.cse18 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse8 (select .cse23 .cse3)) (.cse0 (select .cse18 .cse3)) (.cse1 (select .cse22 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2093) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse7 .cse3))) (< (+ .cse8 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse9 .cse3))) (= .cse8 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| (select .cse10 .cse3))) (not (<= v_ArrVal_2058 (+ (select .cse11 .cse12) 1))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2065) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse14 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| (select .cse15 .cse3))) (not (<= 20 (select (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse19 v_ArrVal_2112) .cse3 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2116)) .cse3))) (< (+ .cse0 1) v_ArrVal_2113) (< (+ .cse1 1) v_ArrVal_2086) (< (+ (select .cse20 .cse3) 1) v_ArrVal_2099) (= .cse21 20))))))))))))))))))))))))))))) is different from false [2022-12-05 22:54:28,273 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2087 (Array Int Int)) (v_ArrVal_2091 Int) (v_ArrVal_2093 Int) (v_ArrVal_2095 Int) (v_ArrVal_2054 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| Int) (v_ArrVal_2075 Int) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2097 Int) (v_ArrVal_2056 Int) (v_ArrVal_2078 Int) (v_ArrVal_2077 Int) (v_ArrVal_2099 Int) (v_ArrVal_2110 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| Int) (v_ArrVal_2113 Int) (v_ArrVal_2112 Int) (v_ArrVal_2116 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2059 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| Int) (v_ArrVal_2060 Int) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2082 Int) (v_ArrVal_2063 Int) (v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2084 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| Int) (v_ArrVal_2065 Int) (v_ArrVal_2086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| Int) (v_ArrVal_2067 Int) (v_ArrVal_2088 Int) (v_ArrVal_2069 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| Int) (v_ArrVal_2104 Int) (v_ArrVal_2103 Int) (v_ArrVal_2106 Int)) (let ((.cse1 (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_2054)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse32 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2056) .cse2 v_ArrVal_2058)) |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse19 (select .cse32 |c_~#queue~0.base|))) (let ((.cse3 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) v_ArrVal_2060)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse30 (store (store .cse32 |c_~#queue~0.base| (store (store .cse3 .cse13 v_ArrVal_2063) .cse4 v_ArrVal_2065)) |c_~#stored_elements~0.base| v_ArrVal_2066))) (let ((.cse15 (select .cse30 |c_~#queue~0.base|))) (let ((.cse31 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| 4) |c_~#queue~0.offset|) v_ArrVal_2067))) (let ((.cse5 (select .cse31 .cse4))) (let ((.cse28 (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse13 v_ArrVal_2069) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2073))) (let ((.cse18 (let ((.cse29 (select .cse28 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse4) 4)) v_ArrVal_2075)))) (let ((.cse27 (store (store .cse28 |c_~#queue~0.base| (store (store .cse18 .cse13 v_ArrVal_2077) .cse4 v_ArrVal_2078)) |c_~#stored_elements~0.base| v_ArrVal_2080))) (let ((.cse17 (select .cse27 |c_~#queue~0.base|))) (let ((.cse22 (store .cse17 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| 4) |c_~#queue~0.offset|) v_ArrVal_2082))) (let ((.cse26 (store (store .cse27 |c_~#queue~0.base| (store (store .cse22 .cse13 v_ArrVal_2084) .cse4 v_ArrVal_2086)) |c_~#stored_elements~0.base| v_ArrVal_2087))) (let ((.cse9 (select .cse26 |c_~#queue~0.base|))) (let ((.cse16 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) v_ArrVal_2088))) (let ((.cse25 (store (store .cse26 |c_~#queue~0.base| (store (store .cse16 .cse13 v_ArrVal_2091) .cse4 v_ArrVal_2093)) |c_~#stored_elements~0.base| v_ArrVal_2094))) (let ((.cse20 (select .cse25 |c_~#queue~0.base|))) (let ((.cse6 (store .cse20 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| 4)) v_ArrVal_2095))) (let ((.cse24 (store (store .cse25 |c_~#queue~0.base| (store (store .cse6 .cse13 v_ArrVal_2097) .cse4 v_ArrVal_2099)) |c_~#stored_elements~0.base| v_ArrVal_2101))) (let ((.cse14 (select .cse24 |c_~#queue~0.base|))) (let ((.cse23 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| 4) |c_~#queue~0.offset|) v_ArrVal_2103))) (let ((.cse11 (store (store .cse24 |c_~#queue~0.base| (store (store .cse23 .cse13 v_ArrVal_2104) .cse4 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse21 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| 4) |c_~#queue~0.offset|) v_ArrVal_2110))) (let ((.cse0 (select .cse12 .cse4)) (.cse8 (select .cse23 .cse4)) (.cse7 (select .cse22 .cse4))) (or (= .cse0 20) (not (<= v_ArrVal_2058 (+ (select .cse1 .cse2) 1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2065) (< (+ .cse0 1) v_ArrVal_2113) (= .cse5 20) (< (+ (select .cse6 .cse4) 1) v_ArrVal_2099) (< (+ .cse7 1) v_ArrVal_2086) (= .cse8 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| (select .cse9 .cse4))) (not (<= 20 (select (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse13 v_ArrVal_2112) .cse4 v_ArrVal_2113)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)) v_ArrVal_2116)) .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_289| (select .cse14 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_299| (select .cse15 .cse4))) (< (+ (select .cse16 .cse4) 1) v_ArrVal_2093) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_295| (select .cse17 .cse4))) (< (+ (select .cse18 .cse4) 1) v_ArrVal_2078) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_301| (select .cse19 .cse4))) (< (+ .cse8 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_291| (select .cse20 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_287| (select .cse21 .cse4))) (= .cse7 20))))))))))))))))))))))))))))) is different from false [2022-12-05 22:55:18,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:55:18,664 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 200337 treesize of output 145607 [2022-12-05 22:56:19,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:56:19,636 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 141664 treesize of output 141602 [2022-12-05 22:56:20,024 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 53128 treesize of output 46984 [2022-12-05 22:56:20,398 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 102029 treesize of output 98957 [2022-12-05 22:56:20,874 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 84622 treesize of output 84614 [2022-12-05 22:56:21,288 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 113986 treesize of output 112450 [2022-12-05 22:56:21,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 109876 treesize of output 109364 [2022-12-05 22:56:22,249 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 105207 treesize of output 104951 [2022-12-05 22:56:22,806 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 102913 treesize of output 102721 [2022-12-05 22:56:23,230 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 22:56:23,327 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 99408 treesize of output 99312 [2022-12-05 22:56:23,761 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 97377 treesize of output 97297 [2022-12-05 22:56:24,209 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 94935 treesize of output 94919 [2022-12-05 22:56:24,650 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-05 22:56:26,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 22:56:26,366 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 29676 treesize of output 29672 [2022-12-05 22:57:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 167 proven. 188 refuted. 176 times theorem prover too weak. 265 trivial. 588 not checked. [2022-12-05 22:57:50,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596711312] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:57:50,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:57:50,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 64] total 142 [2022-12-05 22:57:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602257409] [2022-12-05 22:57:50,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:57:50,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2022-12-05 22:57:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2022-12-05 22:57:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=9047, Unknown=657, NotChecked=7084, Total=20306 [2022-12-05 22:57:50,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-05 22:57:50,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 340 transitions, 4018 flow. Second operand has 143 states, 143 states have (on average 2.027972027972028) internal successors, (290), 142 states have internal predecessors, (290), 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-05 22:57:50,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:50,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-05 22:57:50,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:56,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:58:59,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:59:02,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:59:21,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:59:57,744 WARN L233 SmtUtils]: Spent 14.35s on a formula simplification. DAG size of input: 1290 DAG size of output: 252 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 23:00:50,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 23:00:53,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 23:01:30,744 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 1175 DAG size of output: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 23:03:30,818 WARN L233 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 1054 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 23:03:59,173 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-05 23:03:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-05 23:03:59,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-05 23:03:59,180 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-05 23:03:59,374 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-05 23:03:59,375 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:933) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:500) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-12-05 23:03:59,378 INFO L158 Benchmark]: Toolchain (without parser) took 808374.89ms. Allocated memory was 239.1MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 213.9MB in the beginning and 1.0GB in the end (delta: -812.5MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-05 23:03:59,378 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 239.1MB. Free memory is still 215.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:03:59,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.18ms. Allocated memory is still 239.1MB. Free memory was 213.3MB in the beginning and 183.4MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 23:03:59,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.60ms. Allocated memory is still 239.1MB. Free memory was 183.4MB in the beginning and 180.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:03:59,378 INFO L158 Benchmark]: Boogie Preprocessor took 43.07ms. Allocated memory is still 239.1MB. Free memory was 180.8MB in the beginning and 178.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:03:59,379 INFO L158 Benchmark]: RCFGBuilder took 503.68ms. Allocated memory is still 239.1MB. Free memory was 178.7MB in the beginning and 157.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-05 23:03:59,379 INFO L158 Benchmark]: TraceAbstraction took 807385.38ms. Allocated memory was 239.1MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 157.2MB in the beginning and 1.0GB in the end (delta: -869.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-05 23:03:59,379 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.09ms. Allocated memory is still 239.1MB. Free memory is still 215.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.18ms. Allocated memory is still 239.1MB. Free memory was 213.3MB in the beginning and 183.4MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.60ms. Allocated memory is still 239.1MB. Free memory was 183.4MB in the beginning and 180.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.07ms. Allocated memory is still 239.1MB. Free memory was 180.8MB in the beginning and 178.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 503.68ms. Allocated memory is still 239.1MB. Free memory was 178.7MB in the beginning and 157.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 807385.38ms. Allocated memory was 239.1MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 157.2MB in the beginning and 1.0GB in the end (delta: -869.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 198 PlacesBefore, 46 PlacesAfterwards, 204 TransitionsBefore, 47 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 5 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 6649, independent unconditional: 0, dependent: 206, dependent conditional: 206, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5796, independent: 5695, independent conditional: 0, independent unconditional: 5695, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5796, independent: 5681, independent conditional: 0, independent unconditional: 5681, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 139, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6855, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 5796, unknown conditional: 0, unknown unconditional: 5796] , Statistics on independence cache: Total cache size (in pairs): 9610, Positive cache size: 9509, Positive conditional cache size: 0, Positive unconditional cache size: 9509, Negative cache size: 101, Negative conditional cache size: 0, Negative unconditional cache size: 101, 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, 42 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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.7s, 41 PlacesBefore, 32 PlacesAfterwards, 39 TransitionsBefore, 30 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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, 32 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 62, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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.0s, 31 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 24, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, 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.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 4, 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: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, 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.0s, 56 PlacesBefore, 56 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, 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.7s, 121 PlacesBefore, 119 PlacesAfterwards, 141 TransitionsBefore, 139 TransitionsAfterwards, 658 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 46, dependent conditional: 38, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 48, dependent conditional: 38, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 48, dependent conditional: 38, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 33, dependent conditional: 23, dependent unconditional: 10, unknown: 23, unknown conditional: 22, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 298, Positive conditional cache size: 7, Positive unconditional cache size: 291, Negative cache size: 82, Negative conditional cache size: 17, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 137 PlacesBefore, 137 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 25, dependent conditional: 21, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 26, dependent conditional: 21, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 26, dependent conditional: 21, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 299, Positive conditional cache size: 8, Positive unconditional cache size: 291, Negative cache size: 93, Negative conditional cache size: 28, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 147 PlacesBefore, 147 PlacesAfterwards, 248 TransitionsBefore, 248 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 70, independent conditional: 58, independent unconditional: 12, dependent: 86, dependent conditional: 74, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 70, independent conditional: 50, independent unconditional: 20, dependent: 132, dependent conditional: 104, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 70, independent conditional: 50, independent unconditional: 20, dependent: 132, dependent conditional: 104, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 18, dependent conditional: 17, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 17, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 54, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 64, independent conditional: 45, independent unconditional: 19, dependent: 114, dependent conditional: 87, dependent unconditional: 27, unknown: 24, unknown conditional: 22, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 305, Positive conditional cache size: 13, Positive unconditional cache size: 292, Negative cache size: 111, Negative conditional cache size: 45, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 184 PlacesBefore, 183 PlacesAfterwards, 341 TransitionsBefore, 340 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 380, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 236, dependent conditional: 236, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 380, independent: 144, independent conditional: 106, independent unconditional: 38, dependent: 236, dependent conditional: 198, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 638, independent: 144, independent conditional: 84, independent unconditional: 60, dependent: 494, dependent conditional: 410, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 638, independent: 144, independent conditional: 84, independent unconditional: 60, dependent: 494, dependent conditional: 410, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 638, independent: 131, independent conditional: 71, independent unconditional: 60, dependent: 464, dependent conditional: 380, dependent unconditional: 84, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 318, Positive conditional cache size: 26, Positive unconditional cache size: 292, Negative cache size: 141, Negative conditional cache size: 75, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 2 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...