./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:15:16,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:15:16,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:15:16,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:15:16,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:15:16,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:15:16,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:15:16,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:15:16,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:15:16,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:15:16,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:15:16,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:15:16,211 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:15:16,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:15:16,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:15:16,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:15:16,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:15:16,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:15:16,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:15:16,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:15:16,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:15:16,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:15:16,219 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:15:16,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:15:16,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:15:16,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:15:16,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:15:16,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:15:16,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:15:16,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:15:16,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:15:16,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:16,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:15:16,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:15:16,222 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2024-10-14 17:15:16,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:15:16,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:15:16,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:15:16,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:15:16,537 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:15:16,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-10-14 17:15:17,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:15:17,989 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:15:17,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-10-14 17:15:18,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62345e87e/0cea60081cdb476bbdda5767d42ca89b/FLAG6d8947f79 [2024-10-14 17:15:18,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62345e87e/0cea60081cdb476bbdda5767d42ca89b [2024-10-14 17:15:18,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:15:18,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:15:18,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:18,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:15:18,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:15:18,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e594444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18, skipping insertion in model container [2024-10-14 17:15:18,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:15:18,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:18,247 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:15:18,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:18,301 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:15:18,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18 WrapperNode [2024-10-14 17:15:18,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:18,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:18,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:15:18,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:15:18,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,350 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 348 [2024-10-14 17:15:18,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:18,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:15:18,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:15:18,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:15:18,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:15:18,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:15:18,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:15:18,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:15:18,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (1/1) ... [2024-10-14 17:15:18,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:18,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:18,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:15:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:15:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:15:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:15:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:15:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:15:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:15:18,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:15:18,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:15:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:15:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:15:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 17:15:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 17:15:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:15:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:15:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:15:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:15:18,499 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:15:18,617 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:15:18,619 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:15:19,240 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:15:19,240 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:15:19,471 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:15:19,471 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 17:15:19,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:19 BoogieIcfgContainer [2024-10-14 17:15:19,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:15:19,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:15:19,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:15:19,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:15:19,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:18" (1/3) ... [2024-10-14 17:15:19,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5522e0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:19, skipping insertion in model container [2024-10-14 17:15:19,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:18" (2/3) ... [2024-10-14 17:15:19,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5522e0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:19, skipping insertion in model container [2024-10-14 17:15:19,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:19" (3/3) ... [2024-10-14 17:15:19,479 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2024-10-14 17:15:19,510 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:15:19,510 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-10-14 17:15:19,511 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:15:19,631 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:15:19,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 510 transitions, 1041 flow [2024-10-14 17:15:19,784 INFO L124 PetriNetUnfolderBase]: 27/507 cut-off events. [2024-10-14 17:15:19,784 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:15:19,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 507 events. 27/507 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 632 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 428. Up to 2 conditions per place. [2024-10-14 17:15:19,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 510 transitions, 1041 flow [2024-10-14 17:15:19,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 463 transitions, 944 flow [2024-10-14 17:15:19,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:15:19,817 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5ca539df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:15:19,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2024-10-14 17:15:19,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:15:19,824 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-14 17:15:19,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:15:19,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:19,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:19,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:19,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:19,830 INFO L85 PathProgramCache]: Analyzing trace with hash 64313588, now seen corresponding path program 1 times [2024-10-14 17:15:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026896559] [2024-10-14 17:15:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026896559] [2024-10-14 17:15:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026896559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664129401] [2024-10-14 17:15:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:20,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:20,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:20,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 510 [2024-10-14 17:15:20,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 463 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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) [2024-10-14 17:15:20,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:20,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 510 [2024-10-14 17:15:20,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:20,440 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2024-10-14 17:15:20,440 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 17:15:20,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6484 event pairs, 51 based on Foata normal form. 12/1018 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2024-10-14 17:15:20,455 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2024-10-14 17:15:20,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2024-10-14 17:15:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2024-10-14 17:15:20,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9235294117647059 [2024-10-14 17:15:20,477 INFO L175 Difference]: Start difference. First operand has 449 places, 463 transitions, 944 flow. Second operand 3 states and 1413 transitions. [2024-10-14 17:15:20,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2024-10-14 17:15:20,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:15:20,494 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2024-10-14 17:15:20,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-10-14 17:15:20,503 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2024-10-14 17:15:20,503 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2024-10-14 17:15:20,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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) [2024-10-14 17:15:20,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:20,506 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:20,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:15:20,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:20,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash -123107398, now seen corresponding path program 1 times [2024-10-14 17:15:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:20,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036591723] [2024-10-14 17:15:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:20,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036591723] [2024-10-14 17:15:20,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036591723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:20,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:20,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675119736] [2024-10-14 17:15:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:20,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-10-14 17:15:20,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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) [2024-10-14 17:15:20,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:20,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-10-14 17:15:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:20,760 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2024-10-14 17:15:20,760 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-14 17:15:20,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6518 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2024-10-14 17:15:20,770 INFO L140 encePairwiseOnDemand]: 502/510 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2024-10-14 17:15:20,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2024-10-14 17:15:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2024-10-14 17:15:20,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8947712418300654 [2024-10-14 17:15:20,773 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2024-10-14 17:15:20,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2024-10-14 17:15:20,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:20,779 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2024-10-14 17:15:20,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2024-10-14 17:15:20,781 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2024-10-14 17:15:20,781 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2024-10-14 17:15:20,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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) [2024-10-14 17:15:20,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:20,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:20,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:15:20,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:20,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash 573243807, now seen corresponding path program 1 times [2024-10-14 17:15:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184472889] [2024-10-14 17:15:20,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:21,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184472889] [2024-10-14 17:15:21,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184472889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:21,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512322112] [2024-10-14 17:15:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:21,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:21,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 510 [2024-10-14 17:15:21,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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) [2024-10-14 17:15:21,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:21,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 510 [2024-10-14 17:15:21,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:21,860 INFO L124 PetriNetUnfolderBase]: 236/1331 cut-off events. [2024-10-14 17:15:21,861 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-14 17:15:21,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 1331 events. 236/1331 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7716 event pairs, 188 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1775. Up to 406 conditions per place. [2024-10-14 17:15:21,869 INFO L140 encePairwiseOnDemand]: 492/510 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2024-10-14 17:15:21,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2024-10-14 17:15:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2024-10-14 17:15:21,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7996732026143791 [2024-10-14 17:15:21,905 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2024-10-14 17:15:21,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2024-10-14 17:15:21,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:21,910 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2024-10-14 17:15:21,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2024-10-14 17:15:21,912 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2024-10-14 17:15:21,912 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2024-10-14 17:15:21,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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) [2024-10-14 17:15:21,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:21,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:15:21,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1149357642, now seen corresponding path program 1 times [2024-10-14 17:15:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626024593] [2024-10-14 17:15:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626024593] [2024-10-14 17:15:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626024593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085702591] [2024-10-14 17:15:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:21,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:21,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-10-14 17:15:21,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-10-14 17:15:21,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:21,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-10-14 17:15:21,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:22,050 INFO L124 PetriNetUnfolderBase]: 55/587 cut-off events. [2024-10-14 17:15:22,051 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:15:22,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 587 events. 55/587 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1808 event pairs, 34 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 661. Up to 77 conditions per place. [2024-10-14 17:15:22,054 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-10-14 17:15:22,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2024-10-14 17:15:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-10-14 17:15:22,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-10-14 17:15:22,057 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2024-10-14 17:15:22,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2024-10-14 17:15:22,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:22,062 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2024-10-14 17:15:22,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2024-10-14 17:15:22,063 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2024-10-14 17:15:22,063 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2024-10-14 17:15:22,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-10-14 17:15:22,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:22,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:22,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:15:22,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:22,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1852644211, now seen corresponding path program 1 times [2024-10-14 17:15:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:22,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382144705] [2024-10-14 17:15:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382144705] [2024-10-14 17:15:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382144705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:22,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:22,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145885674] [2024-10-14 17:15:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:22,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:22,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-10-14 17:15:22,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-10-14 17:15:22,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:22,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-10-14 17:15:22,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:22,222 INFO L124 PetriNetUnfolderBase]: 55/586 cut-off events. [2024-10-14 17:15:22,223 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:15:22,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 586 events. 55/586 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1712 event pairs, 34 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 647. Up to 77 conditions per place. [2024-10-14 17:15:22,226 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2024-10-14 17:15:22,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2024-10-14 17:15:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-10-14 17:15:22,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-10-14 17:15:22,229 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2024-10-14 17:15:22,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2024-10-14 17:15:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:22,236 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2024-10-14 17:15:22,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-10-14 17:15:22,238 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2024-10-14 17:15:22,238 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2024-10-14 17:15:22,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-10-14 17:15:22,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:22,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:22,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:15:22,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:22,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1332480732, now seen corresponding path program 1 times [2024-10-14 17:15:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103031242] [2024-10-14 17:15:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103031242] [2024-10-14 17:15:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103031242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:22,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395569723] [2024-10-14 17:15:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:22,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:22,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:22,301 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-10-14 17:15:22,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-10-14 17:15:22,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:22,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-10-14 17:15:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:22,391 INFO L124 PetriNetUnfolderBase]: 23/449 cut-off events. [2024-10-14 17:15:22,392 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:15:22,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 449 events. 23/449 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 757 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 462. Up to 35 conditions per place. [2024-10-14 17:15:22,395 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2024-10-14 17:15:22,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2024-10-14 17:15:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-10-14 17:15:22,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-10-14 17:15:22,399 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2024-10-14 17:15:22,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2024-10-14 17:15:22,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:22,405 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2024-10-14 17:15:22,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2024-10-14 17:15:22,408 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-10-14 17:15:22,409 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2024-10-14 17:15:22,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-10-14 17:15:22,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:22,410 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:22,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:15:22,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1889059969, now seen corresponding path program 1 times [2024-10-14 17:15:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366012850] [2024-10-14 17:15:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:22,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:22,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366012850] [2024-10-14 17:15:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366012850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:22,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:22,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961462128] [2024-10-14 17:15:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:22,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:22,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-10-14 17:15:22,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-10-14 17:15:22,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:22,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-10-14 17:15:22,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:22,553 INFO L124 PetriNetUnfolderBase]: 23/448 cut-off events. [2024-10-14 17:15:22,553 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:15:22,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 448 events. 23/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 759 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 461. Up to 35 conditions per place. [2024-10-14 17:15:22,555 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-14 17:15:22,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2024-10-14 17:15:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-10-14 17:15:22,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-10-14 17:15:22,558 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2024-10-14 17:15:22,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2024-10-14 17:15:22,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:22,563 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2024-10-14 17:15:22,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2024-10-14 17:15:22,565 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-10-14 17:15:22,565 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2024-10-14 17:15:22,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-10-14 17:15:22,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:22,567 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:22,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:15:22,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:22,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 30063585, now seen corresponding path program 1 times [2024-10-14 17:15:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:22,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714281233] [2024-10-14 17:15:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714281233] [2024-10-14 17:15:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714281233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065626745] [2024-10-14 17:15:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:22,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:22,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:22,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-10-14 17:15:22,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-10-14 17:15:22,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:22,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-10-14 17:15:22,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:22,728 INFO L124 PetriNetUnfolderBase]: 109/1164 cut-off events. [2024-10-14 17:15:22,728 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-10-14 17:15:22,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1164 events. 109/1164 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5661 event pairs, 56 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 1290. Up to 135 conditions per place. [2024-10-14 17:15:22,735 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2024-10-14 17:15:22,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2024-10-14 17:15:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-10-14 17:15:22,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-10-14 17:15:22,737 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2024-10-14 17:15:22,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2024-10-14 17:15:22,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:22,758 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2024-10-14 17:15:22,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2024-10-14 17:15:22,760 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-10-14 17:15:22,760 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2024-10-14 17:15:22,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-10-14 17:15:22,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:22,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:22,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:15:22,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 360475418, now seen corresponding path program 1 times [2024-10-14 17:15:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188778323] [2024-10-14 17:15:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188778323] [2024-10-14 17:15:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188778323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949731290] [2024-10-14 17:15:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:23,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:23,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-10-14 17:15:23,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-10-14 17:15:23,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:23,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-10-14 17:15:23,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:23,709 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2024-10-14 17:15:23,709 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-14 17:15:23,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1132 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2024-10-14 17:15:23,713 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2024-10-14 17:15:23,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2024-10-14 17:15:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-10-14 17:15:23,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-10-14 17:15:23,719 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2024-10-14 17:15:23,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2024-10-14 17:15:23,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:23,728 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2024-10-14 17:15:23,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-10-14 17:15:23,730 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2024-10-14 17:15:23,730 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2024-10-14 17:15:23,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-10-14 17:15:23,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:23,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:23,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:15:23,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:23,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -555120169, now seen corresponding path program 1 times [2024-10-14 17:15:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929607214] [2024-10-14 17:15:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929607214] [2024-10-14 17:15:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929607214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:23,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899059328] [2024-10-14 17:15:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:23,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:23,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-10-14 17:15:23,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-10-14 17:15:23,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:23,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-10-14 17:15:23,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:23,909 INFO L124 PetriNetUnfolderBase]: 69/627 cut-off events. [2024-10-14 17:15:23,909 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-14 17:15:23,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 627 events. 69/627 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1973 event pairs, 36 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 757. Up to 98 conditions per place. [2024-10-14 17:15:23,915 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-10-14 17:15:23,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2024-10-14 17:15:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-10-14 17:15:23,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-10-14 17:15:23,920 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2024-10-14 17:15:23,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2024-10-14 17:15:23,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 17:15:23,927 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2024-10-14 17:15:23,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2024-10-14 17:15:23,929 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-10-14 17:15:23,929 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2024-10-14 17:15:23,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-10-14 17:15:23,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:23,930 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:15:23,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash -620784319, now seen corresponding path program 1 times [2024-10-14 17:15:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775984892] [2024-10-14 17:15:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775984892] [2024-10-14 17:15:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775984892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:23,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:23,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548722898] [2024-10-14 17:15:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:23,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-10-14 17:15:23,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-10-14 17:15:23,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:23,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-10-14 17:15:23,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:24,191 INFO L124 PetriNetUnfolderBase]: 125/1187 cut-off events. [2024-10-14 17:15:24,191 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 17:15:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1187 events. 125/1187 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5853 event pairs, 58 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1384. Up to 158 conditions per place. [2024-10-14 17:15:24,202 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2024-10-14 17:15:24,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2024-10-14 17:15:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-10-14 17:15:24,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-10-14 17:15:24,207 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2024-10-14 17:15:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2024-10-14 17:15:24,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:24,215 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2024-10-14 17:15:24,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2024-10-14 17:15:24,217 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2024-10-14 17:15:24,217 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2024-10-14 17:15:24,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-10-14 17:15:24,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:24,218 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:24,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:15:24,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1135693127, now seen corresponding path program 1 times [2024-10-14 17:15:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427439439] [2024-10-14 17:15:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:24,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:24,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427439439] [2024-10-14 17:15:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427439439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930168258] [2024-10-14 17:15:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:24,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-10-14 17:15:24,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-10-14 17:15:24,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:24,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-10-14 17:15:24,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,102 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2024-10-14 17:15:25,102 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-14 17:15:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1107 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-10-14 17:15:25,106 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2024-10-14 17:15:25,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2024-10-14 17:15:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-10-14 17:15:25,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-10-14 17:15:25,110 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2024-10-14 17:15:25,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2024-10-14 17:15:25,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:25,115 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2024-10-14 17:15:25,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2024-10-14 17:15:25,116 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2024-10-14 17:15:25,116 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2024-10-14 17:15:25,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-10-14 17:15:25,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,118 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:25,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:15:25,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:25,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1178971585, now seen corresponding path program 1 times [2024-10-14 17:15:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432864399] [2024-10-14 17:15:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:25,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432864399] [2024-10-14 17:15:25,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432864399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117837924] [2024-10-14 17:15:25,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-10-14 17:15:25,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-10-14 17:15:25,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-10-14 17:15:25,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,310 INFO L124 PetriNetUnfolderBase]: 69/620 cut-off events. [2024-10-14 17:15:25,311 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-14 17:15:25,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 620 events. 69/620 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1912 event pairs, 36 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 752. Up to 98 conditions per place. [2024-10-14 17:15:25,315 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-10-14 17:15:25,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2024-10-14 17:15:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-10-14 17:15:25,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-10-14 17:15:25,319 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2024-10-14 17:15:25,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2024-10-14 17:15:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:25,326 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2024-10-14 17:15:25,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2024-10-14 17:15:25,327 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2024-10-14 17:15:25,327 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2024-10-14 17:15:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-10-14 17:15:25,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:15:25,329 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:25,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1081886323, now seen corresponding path program 1 times [2024-10-14 17:15:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339165717] [2024-10-14 17:15:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339165717] [2024-10-14 17:15:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339165717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605873691] [2024-10-14 17:15:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-10-14 17:15:25,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-10-14 17:15:25,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-10-14 17:15:25,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,470 INFO L124 PetriNetUnfolderBase]: 31/461 cut-off events. [2024-10-14 17:15:25,470 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:15:25,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 461 events. 31/461 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 843 event pairs, 14 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 506. Up to 50 conditions per place. [2024-10-14 17:15:25,473 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-10-14 17:15:25,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2024-10-14 17:15:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-10-14 17:15:25,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9124183006535947 [2024-10-14 17:15:25,476 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2024-10-14 17:15:25,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2024-10-14 17:15:25,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:25,481 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2024-10-14 17:15:25,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2024-10-14 17:15:25,483 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2024-10-14 17:15:25,483 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2024-10-14 17:15:25,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-10-14 17:15:25,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:25,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:15:25,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:25,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 688744348, now seen corresponding path program 1 times [2024-10-14 17:15:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058576155] [2024-10-14 17:15:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:25,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058576155] [2024-10-14 17:15:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058576155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381701824] [2024-10-14 17:15:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-10-14 17:15:25,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-10-14 17:15:25,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-10-14 17:15:25,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,748 INFO L124 PetriNetUnfolderBase]: 113/1198 cut-off events. [2024-10-14 17:15:25,748 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 17:15:25,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1198 events. 113/1198 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6615 event pairs, 25 based on Foata normal form. 0/1089 useless extension candidates. Maximal degree in co-relation 1392. Up to 91 conditions per place. [2024-10-14 17:15:25,755 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2024-10-14 17:15:25,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2024-10-14 17:15:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2024-10-14 17:15:25,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9196078431372549 [2024-10-14 17:15:25,757 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2024-10-14 17:15:25,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2024-10-14 17:15:25,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:25,762 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2024-10-14 17:15:25,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2024-10-14 17:15:25,763 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2024-10-14 17:15:25,763 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2024-10-14 17:15:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-10-14 17:15:25,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:25,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:15:25,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:25,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1410606142, now seen corresponding path program 1 times [2024-10-14 17:15:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460880956] [2024-10-14 17:15:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:25,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460880956] [2024-10-14 17:15:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460880956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:15:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425707082] [2024-10-14 17:15:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:15:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:15:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:15:26,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 510 [2024-10-14 17:15:26,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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) [2024-10-14 17:15:26,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 510 [2024-10-14 17:15:26,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,726 INFO L124 PetriNetUnfolderBase]: 256/1901 cut-off events. [2024-10-14 17:15:26,726 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-10-14 17:15:26,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1901 events. 256/1901 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9860 event pairs, 122 based on Foata normal form. 9/1758 useless extension candidates. Maximal degree in co-relation 2446. Up to 245 conditions per place. [2024-10-14 17:15:26,738 INFO L140 encePairwiseOnDemand]: 481/510 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2024-10-14 17:15:26,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2024-10-14 17:15:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:15:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 17:15:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2024-10-14 17:15:26,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8709803921568627 [2024-10-14 17:15:26,745 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2024-10-14 17:15:26,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2024-10-14 17:15:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:26,752 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2024-10-14 17:15:26,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2024-10-14 17:15:26,753 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-10-14 17:15:26,753 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2024-10-14 17:15:26,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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) [2024-10-14 17:15:26,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:26,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:15:26,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:26,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1577782458, now seen corresponding path program 1 times [2024-10-14 17:15:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967312290] [2024-10-14 17:15:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:26,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967312290] [2024-10-14 17:15:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967312290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386447685] [2024-10-14 17:15:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:26,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 510 [2024-10-14 17:15:26,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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) [2024-10-14 17:15:26,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 510 [2024-10-14 17:15:26,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,937 INFO L124 PetriNetUnfolderBase]: 87/956 cut-off events. [2024-10-14 17:15:26,937 INFO L125 PetriNetUnfolderBase]: For 68/80 co-relation queries the response was YES. [2024-10-14 17:15:26,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 956 events. 87/956 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2739 event pairs, 39 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1202. Up to 125 conditions per place. [2024-10-14 17:15:26,943 INFO L140 encePairwiseOnDemand]: 508/510 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-10-14 17:15:26,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2024-10-14 17:15:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2024-10-14 17:15:26,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9183006535947712 [2024-10-14 17:15:26,945 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2024-10-14 17:15:26,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2024-10-14 17:15:26,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:26,952 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2024-10-14 17:15:26,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2024-10-14 17:15:26,953 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-10-14 17:15:26,953 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2024-10-14 17:15:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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) [2024-10-14 17:15:26,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,953 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:26,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:15:26,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1541076308, now seen corresponding path program 1 times [2024-10-14 17:15:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887037336] [2024-10-14 17:15:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887037336] [2024-10-14 17:15:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887037336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293857433] [2024-10-14 17:15:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:27,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:27,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-10-14 17:15:27,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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) [2024-10-14 17:15:27,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:27,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-10-14 17:15:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,315 INFO L124 PetriNetUnfolderBase]: 238/2127 cut-off events. [2024-10-14 17:15:27,316 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-10-14 17:15:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 2127 events. 238/2127 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12968 event pairs, 61 based on Foata normal form. 4/1994 useless extension candidates. Maximal degree in co-relation 2737. Up to 176 conditions per place. [2024-10-14 17:15:27,328 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2024-10-14 17:15:27,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2024-10-14 17:15:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2024-10-14 17:15:27,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.918954248366013 [2024-10-14 17:15:27,331 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2024-10-14 17:15:27,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2024-10-14 17:15:27,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:27,338 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2024-10-14 17:15:27,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2024-10-14 17:15:27,338 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-10-14 17:15:27,338 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2024-10-14 17:15:27,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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) [2024-10-14 17:15:27,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:27,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:15:27,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:27,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1969656587, now seen corresponding path program 1 times [2024-10-14 17:15:27,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632419041] [2024-10-14 17:15:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:27,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632419041] [2024-10-14 17:15:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632419041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:15:27,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739998612] [2024-10-14 17:15:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:15:27,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:27,639 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) [2024-10-14 17:15:27,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:15:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:15:27,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:15:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:28,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:15:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739998612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:15:28,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:15:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-14 17:15:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407427849] [2024-10-14 17:15:28,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:15:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 17:15:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 17:15:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-10-14 17:15:29,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 510 [2024-10-14 17:15:29,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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) [2024-10-14 17:15:29,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:29,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 510 [2024-10-14 17:15:29,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:30,628 INFO L124 PetriNetUnfolderBase]: 491/2909 cut-off events. [2024-10-14 17:15:30,628 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-10-14 17:15:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2909 events. 491/2909 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18077 event pairs, 201 based on Foata normal form. 9/2686 useless extension candidates. Maximal degree in co-relation 4164. Up to 437 conditions per place. [2024-10-14 17:15:30,644 INFO L140 encePairwiseOnDemand]: 471/510 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2024-10-14 17:15:30,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2024-10-14 17:15:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:15:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-14 17:15:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2024-10-14 17:15:30,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8479876160990713 [2024-10-14 17:15:30,655 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2024-10-14 17:15:30,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2024-10-14 17:15:30,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-10-14 17:15:30,662 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2024-10-14 17:15:30,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2024-10-14 17:15:30,663 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2024-10-14 17:15:30,663 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2024-10-14 17:15:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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) [2024-10-14 17:15:30,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:30,670 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:30,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:15:30,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:15:30,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -562157278, now seen corresponding path program 2 times [2024-10-14 17:15:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042596830] [2024-10-14 17:15:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:15:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042596830] [2024-10-14 17:15:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042596830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:31,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:31,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862793312] [2024-10-14 17:15:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:31,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:31,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:31,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-10-14 17:15:31,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-10-14 17:15:31,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:31,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-10-14 17:15:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:32,679 INFO L124 PetriNetUnfolderBase]: 653/3303 cut-off events. [2024-10-14 17:15:32,680 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-10-14 17:15:32,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5006 conditions, 3303 events. 653/3303 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25168 event pairs, 130 based on Foata normal form. 0/3059 useless extension candidates. Maximal degree in co-relation 4956. Up to 607 conditions per place. [2024-10-14 17:15:32,698 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2024-10-14 17:15:32,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2024-10-14 17:15:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-10-14 17:15:32,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-10-14 17:15:32,702 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2024-10-14 17:15:32,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2024-10-14 17:15:32,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-10-14 17:15:32,708 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2024-10-14 17:15:32,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2024-10-14 17:15:32,709 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2024-10-14 17:15:32,709 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2024-10-14 17:15:32,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-10-14 17:15:32,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:32,713 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:32,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:15:32,713 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:32,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 592738246, now seen corresponding path program 1 times [2024-10-14 17:15:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10931033] [2024-10-14 17:15:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:15:34,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:34,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10931033] [2024-10-14 17:15:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10931033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:34,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-14 17:15:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999667584] [2024-10-14 17:15:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:34,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:15:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:34,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:15:34,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:15:37,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-10-14 17:15:37,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-10-14 17:15:37,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:37,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-10-14 17:15:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:39,800 INFO L124 PetriNetUnfolderBase]: 1671/7904 cut-off events. [2024-10-14 17:15:39,800 INFO L125 PetriNetUnfolderBase]: For 3160/3664 co-relation queries the response was YES. [2024-10-14 17:15:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13758 conditions, 7904 events. 1671/7904 cut-off events. For 3160/3664 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 81514 event pairs, 448 based on Foata normal form. 180/7364 useless extension candidates. Maximal degree in co-relation 13710. Up to 1419 conditions per place. [2024-10-14 17:15:39,861 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 82 selfloop transitions, 44 changer transitions 0/468 dead transitions. [2024-10-14 17:15:39,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 468 transitions, 1579 flow [2024-10-14 17:15:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 17:15:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-14 17:15:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13254 transitions. [2024-10-14 17:15:39,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8121323529411765 [2024-10-14 17:15:39,882 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 32 states and 13254 transitions. [2024-10-14 17:15:39,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 468 transitions, 1579 flow [2024-10-14 17:15:39,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 468 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:39,894 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1330 flow [2024-10-14 17:15:39,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1330, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2024-10-14 17:15:39,895 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -9 predicate places. [2024-10-14 17:15:39,896 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1330 flow [2024-10-14 17:15:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-10-14 17:15:39,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:39,898 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:39,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:15:39,898 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:39,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1817904910, now seen corresponding path program 2 times [2024-10-14 17:15:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249863576] [2024-10-14 17:15:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:39,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:15:41,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:41,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249863576] [2024-10-14 17:15:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249863576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:41,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:41,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-14 17:15:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189013759] [2024-10-14 17:15:41,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:41,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:15:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:15:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:15:44,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-10-14 17:15:44,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1330 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-10-14 17:15:44,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:44,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-10-14 17:15:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:48,256 INFO L124 PetriNetUnfolderBase]: 2275/11656 cut-off events. [2024-10-14 17:15:48,257 INFO L125 PetriNetUnfolderBase]: For 10570/12098 co-relation queries the response was YES. [2024-10-14 17:15:48,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22460 conditions, 11656 events. 2275/11656 cut-off events. For 10570/12098 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 128633 event pairs, 608 based on Foata normal form. 196/10671 useless extension candidates. Maximal degree in co-relation 22407. Up to 1914 conditions per place. [2024-10-14 17:15:48,345 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 101 selfloop transitions, 50 changer transitions 0/493 dead transitions. [2024-10-14 17:15:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 493 transitions, 1971 flow [2024-10-14 17:15:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 17:15:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-14 17:15:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13253 transitions. [2024-10-14 17:15:48,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8120710784313725 [2024-10-14 17:15:48,355 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1330 flow. Second operand 32 states and 13253 transitions. [2024-10-14 17:15:48,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 493 transitions, 1971 flow [2024-10-14 17:15:48,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 493 transitions, 1920 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-10-14 17:15:48,376 INFO L231 Difference]: Finished difference. Result has 449 places, 451 transitions, 1578 flow [2024-10-14 17:15:48,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1578, PETRI_PLACES=449, PETRI_TRANSITIONS=451} [2024-10-14 17:15:48,377 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 0 predicate places. [2024-10-14 17:15:48,377 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 451 transitions, 1578 flow [2024-10-14 17:15:48,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-10-14 17:15:48,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:48,380 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:15:48,380 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:48,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1116933197, now seen corresponding path program 1 times [2024-10-14 17:15:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358123398] [2024-10-14 17:15:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:15:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358123398] [2024-10-14 17:15:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358123398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305914710] [2024-10-14 17:15:49,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:49,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:49,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:49,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-10-14 17:15:49,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 451 transitions, 1578 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-10-14 17:15:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:49,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-10-14 17:15:49,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:53,290 INFO L124 PetriNetUnfolderBase]: 4780/18262 cut-off events. [2024-10-14 17:15:53,290 INFO L125 PetriNetUnfolderBase]: For 20740/21095 co-relation queries the response was YES. [2024-10-14 17:15:53,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39090 conditions, 18262 events. 4780/18262 cut-off events. For 20740/21095 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 211141 event pairs, 781 based on Foata normal form. 266/17189 useless extension candidates. Maximal degree in co-relation 39036. Up to 3538 conditions per place. [2024-10-14 17:15:53,463 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 76 selfloop transitions, 32 changer transitions 0/496 dead transitions. [2024-10-14 17:15:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 496 transitions, 2015 flow [2024-10-14 17:15:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-10-14 17:15:53,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-10-14 17:15:53,468 INFO L175 Difference]: Start difference. First operand has 449 places, 451 transitions, 1578 flow. Second operand 6 states and 2703 transitions. [2024-10-14 17:15:53,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 496 transitions, 2015 flow [2024-10-14 17:15:53,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 496 transitions, 1940 flow, removed 12 selfloop flow, removed 26 redundant places. [2024-10-14 17:15:53,498 INFO L231 Difference]: Finished difference. Result has 433 places, 477 transitions, 1844 flow [2024-10-14 17:15:53,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1844, PETRI_PLACES=433, PETRI_TRANSITIONS=477} [2024-10-14 17:15:53,499 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -16 predicate places. [2024-10-14 17:15:53,499 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 477 transitions, 1844 flow [2024-10-14 17:15:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-10-14 17:15:53,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:53,500 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:15:53,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1489406644, now seen corresponding path program 1 times [2024-10-14 17:15:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369279651] [2024-10-14 17:15:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:15:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:53,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369279651] [2024-10-14 17:15:53,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369279651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:53,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:53,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145139668] [2024-10-14 17:15:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:53,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:53,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:53,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-10-14 17:15:53,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 477 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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) [2024-10-14 17:15:53,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:53,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-10-14 17:15:53,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:56,503 INFO L124 PetriNetUnfolderBase]: 3185/14336 cut-off events. [2024-10-14 17:15:56,503 INFO L125 PetriNetUnfolderBase]: For 27853/28469 co-relation queries the response was YES. [2024-10-14 17:15:56,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32599 conditions, 14336 events. 3185/14336 cut-off events. For 27853/28469 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 165963 event pairs, 917 based on Foata normal form. 131/13054 useless extension candidates. Maximal degree in co-relation 32542. Up to 2701 conditions per place. [2024-10-14 17:15:56,680 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 49 selfloop transitions, 2 changer transitions 0/483 dead transitions. [2024-10-14 17:15:56,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 483 transitions, 1986 flow [2024-10-14 17:15:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-10-14 17:15:56,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-10-14 17:15:56,681 INFO L175 Difference]: Start difference. First operand has 433 places, 477 transitions, 1844 flow. Second operand 3 states and 1398 transitions. [2024-10-14 17:15:56,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 483 transitions, 1986 flow [2024-10-14 17:15:56,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 483 transitions, 1970 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:56,726 INFO L231 Difference]: Finished difference. Result has 434 places, 476 transitions, 1830 flow [2024-10-14 17:15:56,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1830, PETRI_PLACES=434, PETRI_TRANSITIONS=476} [2024-10-14 17:15:56,727 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -15 predicate places. [2024-10-14 17:15:56,727 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 476 transitions, 1830 flow [2024-10-14 17:15:56,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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) [2024-10-14 17:15:56,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:56,728 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:56,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:15:56,728 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:15:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -851236923, now seen corresponding path program 1 times [2024-10-14 17:15:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930447927] [2024-10-14 17:15:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 17:15:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930447927] [2024-10-14 17:15:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930447927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:15:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796110290] [2024-10-14 17:15:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:57,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:15:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:57,269 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) [2024-10-14 17:15:57,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:15:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:57,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 17:15:57,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:15:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 17:15:57,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:15:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 17:15:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796110290] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:15:58,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:15:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-10-14 17:15:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553574202] [2024-10-14 17:15:58,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:15:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 17:15:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:58,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 17:15:58,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-10-14 17:15:59,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 510 [2024-10-14 17:15:59,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 476 transitions, 1830 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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) [2024-10-14 17:15:59,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:59,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 510 [2024-10-14 17:15:59,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:16:06,939 INFO L124 PetriNetUnfolderBase]: 7157/29496 cut-off events. [2024-10-14 17:16:06,939 INFO L125 PetriNetUnfolderBase]: For 45030/51021 co-relation queries the response was YES. [2024-10-14 17:16:07,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66911 conditions, 29496 events. 7157/29496 cut-off events. For 45030/51021 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 359164 event pairs, 2138 based on Foata normal form. 662/28311 useless extension candidates. Maximal degree in co-relation 66851. Up to 6149 conditions per place. [2024-10-14 17:16:07,313 INFO L140 encePairwiseOnDemand]: 468/510 looper letters, 130 selfloop transitions, 115 changer transitions 0/611 dead transitions. [2024-10-14 17:16:07,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 611 transitions, 3025 flow [2024-10-14 17:16:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 17:16:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-10-14 17:16:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2024-10-14 17:16:07,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8394463667820069 [2024-10-14 17:16:07,328 INFO L175 Difference]: Start difference. First operand has 434 places, 476 transitions, 1830 flow. Second operand 34 states and 14556 transitions. [2024-10-14 17:16:07,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 611 transitions, 3025 flow [2024-10-14 17:16:07,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 611 transitions, 3021 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:16:07,403 INFO L231 Difference]: Finished difference. Result has 475 places, 554 transitions, 2560 flow [2024-10-14 17:16:07,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2560, PETRI_PLACES=475, PETRI_TRANSITIONS=554} [2024-10-14 17:16:07,404 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 26 predicate places. [2024-10-14 17:16:07,405 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 554 transitions, 2560 flow [2024-10-14 17:16:07,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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) [2024-10-14 17:16:07,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:16:07,408 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:16:07,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:16:07,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 17:16:07,609 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:16:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:16:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1975076787, now seen corresponding path program 1 times [2024-10-14 17:16:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:16:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845022472] [2024-10-14 17:16:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:16:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:16:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:16:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:16:08,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:16:08,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845022472] [2024-10-14 17:16:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845022472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:16:08,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:16:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 17:16:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163010773] [2024-10-14 17:16:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:16:08,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:16:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:16:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:16:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:16:10,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-10-14 17:16:10,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 554 transitions, 2560 flow. Second operand has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-10-14 17:16:10,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:16:10,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-10-14 17:16:10,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:16:18,538 INFO L124 PetriNetUnfolderBase]: 8444/33360 cut-off events. [2024-10-14 17:16:18,539 INFO L125 PetriNetUnfolderBase]: For 66317/69168 co-relation queries the response was YES. [2024-10-14 17:16:18,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80864 conditions, 33360 events. 8444/33360 cut-off events. For 66317/69168 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 407757 event pairs, 1702 based on Foata normal form. 1014/31465 useless extension candidates. Maximal degree in co-relation 80790. Up to 5335 conditions per place. [2024-10-14 17:16:19,169 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 149 selfloop transitions, 67 changer transitions 0/635 dead transitions. [2024-10-14 17:16:19,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 635 transitions, 3628 flow [2024-10-14 17:16:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 17:16:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-14 17:16:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 10057 transitions. [2024-10-14 17:16:19,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216503267973856 [2024-10-14 17:16:19,175 INFO L175 Difference]: Start difference. First operand has 475 places, 554 transitions, 2560 flow. Second operand 24 states and 10057 transitions. [2024-10-14 17:16:19,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 635 transitions, 3628 flow [2024-10-14 17:16:19,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 635 transitions, 3544 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-10-14 17:16:19,309 INFO L231 Difference]: Finished difference. Result has 498 places, 566 transitions, 2825 flow [2024-10-14 17:16:19,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2825, PETRI_PLACES=498, PETRI_TRANSITIONS=566} [2024-10-14 17:16:19,313 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 49 predicate places. [2024-10-14 17:16:19,313 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 566 transitions, 2825 flow [2024-10-14 17:16:19,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-10-14 17:16:19,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:16:19,315 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:16:19,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:16:19,315 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:16:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:16:19,316 INFO L85 PathProgramCache]: Analyzing trace with hash -813073543, now seen corresponding path program 2 times [2024-10-14 17:16:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:16:19,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015551605] [2024-10-14 17:16:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:16:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:16:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:16:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:16:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:16:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015551605] [2024-10-14 17:16:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015551605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:16:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:16:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 17:16:20,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537758864] [2024-10-14 17:16:20,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:16:20,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:16:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:16:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:16:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:16:21,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-10-14 17:16:21,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 566 transitions, 2825 flow. Second operand has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-10-14 17:16:21,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:16:21,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-10-14 17:16:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:16:28,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][599], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 14#L50-8true, Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 548#true, 522#(= |#race~A~0| 0), Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, 576#true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:28,904 INFO L294 olderBase$Statistics]: this new event has 427 ancestors and is cut-off event [2024-10-14 17:16:28,904 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-10-14 17:16:28,904 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2024-10-14 17:16:28,904 INFO L297 olderBase$Statistics]: existing Event has 413 ancestors and is cut-off event [2024-10-14 17:16:29,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][608], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 333#L52-5true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:29,622 INFO L294 olderBase$Statistics]: this new event has 439 ancestors and is cut-off event [2024-10-14 17:16:29,622 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2024-10-14 17:16:29,623 INFO L297 olderBase$Statistics]: existing Event has 425 ancestors and is cut-off event [2024-10-14 17:16:29,623 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is cut-off event [2024-10-14 17:16:29,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][614], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 254#L52-6true, 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:29,704 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is cut-off event [2024-10-14 17:16:29,704 INFO L297 olderBase$Statistics]: existing Event has 426 ancestors and is cut-off event [2024-10-14 17:16:29,704 INFO L297 olderBase$Statistics]: existing Event has 433 ancestors and is cut-off event [2024-10-14 17:16:29,705 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is cut-off event [2024-10-14 17:16:29,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][618], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 328#L52-7true, 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:29,796 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-10-14 17:16:29,796 INFO L297 olderBase$Statistics]: existing Event has 434 ancestors and is cut-off event [2024-10-14 17:16:29,796 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-10-14 17:16:29,796 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2024-10-14 17:16:29,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2472#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 4747#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 71#L52-9true, 363#L68true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:29,872 INFO L294 olderBase$Statistics]: this new event has 443 ancestors and is cut-off event [2024-10-14 17:16:29,872 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2024-10-14 17:16:29,872 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2024-10-14 17:16:29,872 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-10-14 17:16:29,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2472#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 4747#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 437#L61-6true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 71#L52-9true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:29,873 INFO L294 olderBase$Statistics]: this new event has 438 ancestors and is cut-off event [2024-10-14 17:16:29,873 INFO L297 olderBase$Statistics]: existing Event has 438 ancestors and is cut-off event [2024-10-14 17:16:29,873 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-10-14 17:16:29,873 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is cut-off event [2024-10-14 17:16:29,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][622], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 451#L52-8true, Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-10-14 17:16:29,874 INFO L294 olderBase$Statistics]: this new event has 442 ancestors and is cut-off event [2024-10-14 17:16:29,874 INFO L297 olderBase$Statistics]: existing Event has 442 ancestors and is cut-off event [2024-10-14 17:16:29,874 INFO L297 olderBase$Statistics]: existing Event has 435 ancestors and is cut-off event [2024-10-14 17:16:29,874 INFO L297 olderBase$Statistics]: existing Event has 428 ancestors and is cut-off event [2024-10-14 17:16:31,275 INFO L124 PetriNetUnfolderBase]: 8230/36897 cut-off events. [2024-10-14 17:16:31,275 INFO L125 PetriNetUnfolderBase]: For 87507/90601 co-relation queries the response was YES. [2024-10-14 17:16:31,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93639 conditions, 36897 events. 8230/36897 cut-off events. For 87507/90601 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 472589 event pairs, 1035 based on Foata normal form. 1619/36055 useless extension candidates. Maximal degree in co-relation 93560. Up to 4724 conditions per place. [2024-10-14 17:16:31,775 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 112 selfloop transitions, 103 changer transitions 0/634 dead transitions. [2024-10-14 17:16:31,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 634 transitions, 3807 flow [2024-10-14 17:16:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 17:16:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-14 17:16:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10477 transitions. [2024-10-14 17:16:31,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8217254901960784 [2024-10-14 17:16:31,783 INFO L175 Difference]: Start difference. First operand has 498 places, 566 transitions, 2825 flow. Second operand 25 states and 10477 transitions. [2024-10-14 17:16:31,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 634 transitions, 3807 flow [2024-10-14 17:16:31,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 634 transitions, 3739 flow, removed 1 selfloop flow, removed 19 redundant places. [2024-10-14 17:16:31,985 INFO L231 Difference]: Finished difference. Result has 506 places, 590 transitions, 3362 flow [2024-10-14 17:16:31,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2749, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3362, PETRI_PLACES=506, PETRI_TRANSITIONS=590} [2024-10-14 17:16:31,986 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 57 predicate places. [2024-10-14 17:16:31,986 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 590 transitions, 3362 flow [2024-10-14 17:16:31,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-10-14 17:16:31,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:16:31,987 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:16:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 17:16:31,987 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-10-14 17:16:31,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:16:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 664047267, now seen corresponding path program 1 times [2024-10-14 17:16:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:16:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339433042] [2024-10-14 17:16:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:16:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:16:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:16:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-14 17:16:32,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:16:32,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339433042] [2024-10-14 17:16:32,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339433042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:16:32,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:16:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:16:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015082504] [2024-10-14 17:16:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:16:32,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:16:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:16:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:16:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:16:32,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-10-14 17:16:32,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 590 transitions, 3362 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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) [2024-10-14 17:16:32,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:16:32,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-10-14 17:16:32,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand