./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-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d 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-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:59:49,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:59:49,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:59:49,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:59:49,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:59:49,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:59:49,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:59:49,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:59:49,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:59:49,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:59:49,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:59:49,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:59:49,983 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:59:49,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:59:49,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:59:49,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:59:49,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:59:49,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:59:49,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:59:49,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:59:49,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:59:49,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:59:49,990 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:59:49,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:59:49,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:59:49,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:59:49,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:59:49,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:59:49,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:59:49,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:59:49,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:59:49,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:59:49,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:59:49,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:59:49,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:59:49,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:59:49,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:59:49,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:59:49,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:59:49,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:59:49,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:59:49,998 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-10-13 09:59:50,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:59:50,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:59:50,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:59:50,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:59:50,273 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:59:50,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-10-13 09:59:51,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:59:51,955 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:59:51,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-10-13 09:59:51,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9dcf903/1ec442c425584db7800a707046655f71/FLAGd271ec1bd [2024-10-13 09:59:51,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9dcf903/1ec442c425584db7800a707046655f71 [2024-10-13 09:59:51,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:59:51,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:59:51,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:59:51,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:59:51,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:59:51,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:59:51" (1/1) ... [2024-10-13 09:59:51,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6e3e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:51, skipping insertion in model container [2024-10-13 09:59:51,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:59:51" (1/1) ... [2024-10-13 09:59:52,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:59:52,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:59:52,276 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:59:52,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:59:52,349 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:59:52,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52 WrapperNode [2024-10-13 09:59:52,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:59:52,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:59:52,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:59:52,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:59:52,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,415 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 384 [2024-10-13 09:59:52,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:59:52,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:59:52,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:59:52,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:59:52,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:59:52,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:59:52,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:59:52,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:59:52,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (1/1) ... [2024-10-13 09:59:52,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:59:52,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:59:52,541 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-13 09:59:52,548 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-13 09:59:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:59:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:59:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:59:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:59:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:59:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:59:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:59:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:59:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:59:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:59:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:59:52,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:59:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:59:52,602 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:59:52,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:59:52,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:59:53,375 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:59:53,375 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:59:53,412 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:59:53,412 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 09:59:53,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:53 BoogieIcfgContainer [2024-10-13 09:59:53,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:59:53,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:59:53,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:59:53,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:59:53,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:59:51" (1/3) ... [2024-10-13 09:59:53,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1842ea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:59:53, skipping insertion in model container [2024-10-13 09:59:53,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:52" (2/3) ... [2024-10-13 09:59:53,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1842ea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:59:53, skipping insertion in model container [2024-10-13 09:59:53,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:53" (3/3) ... [2024-10-13 09:59:53,421 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-10-13 09:59:53,456 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:59:53,457 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-13 09:59:53,457 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:59:53,626 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:59:53,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 518 transitions, 1057 flow [2024-10-13 09:59:53,888 INFO L124 PetriNetUnfolderBase]: 29/515 cut-off events. [2024-10-13 09:59:53,889 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:59:53,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 515 events. 29/515 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 867 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2024-10-13 09:59:53,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 518 transitions, 1057 flow [2024-10-13 09:59:53,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 471 transitions, 960 flow [2024-10-13 09:59:53,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:59:53,941 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;@3063ab30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:59:53,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-13 09:59:53,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:59:53,949 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-13 09:59:53,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:59:53,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:53,950 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] [2024-10-13 09:59:53,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:53,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -97437285, now seen corresponding path program 1 times [2024-10-13 09:59:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308393794] [2024-10-13 09:59:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:54,149 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-13 09:59:54,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:54,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308393794] [2024-10-13 09:59:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308393794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669369610] [2024-10-13 09:59:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:54,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:54,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 518 [2024-10-13 09:59:54,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 471 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-13 09:59:54,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:54,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 518 [2024-10-13 09:59:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:54,611 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2024-10-13 09:59:54,611 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-13 09:59:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5177 event pairs, 15 based on Foata normal form. 37/937 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2024-10-13 09:59:54,632 INFO L140 encePairwiseOnDemand]: 495/518 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2024-10-13 09:59:54,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2024-10-13 09:59:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-10-13 09:59:54,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-13 09:59:54,660 INFO L175 Difference]: Start difference. First operand has 455 places, 471 transitions, 960 flow. Second operand 3 states and 1463 transitions. [2024-10-13 09:59:54,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2024-10-13 09:59:54,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:59:54,676 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2024-10-13 09:59:54,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2024-10-13 09:59:54,685 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-13 09:59:54,686 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2024-10-13 09:59:54,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-13 09:59:54,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:54,688 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] [2024-10-13 09:59:54,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:59:54,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:54,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1490081496, now seen corresponding path program 1 times [2024-10-13 09:59:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572435269] [2024-10-13 09:59:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:54,751 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-13 09:59:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572435269] [2024-10-13 09:59:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572435269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872057870] [2024-10-13 09:59:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:54,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:54,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:54,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:54,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 518 [2024-10-13 09:59:54,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 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-13 09:59:54,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:54,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 518 [2024-10-13 09:59:54,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:55,354 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2024-10-13 09:59:55,355 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-13 09:59:55,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19686 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2024-10-13 09:59:55,389 INFO L140 encePairwiseOnDemand]: 511/518 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2024-10-13 09:59:55,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2024-10-13 09:59:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-10-13 09:59:55,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-10-13 09:59:55,397 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2024-10-13 09:59:55,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2024-10-13 09:59:55,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:55,464 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2024-10-13 09:59:55,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2024-10-13 09:59:55,467 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-10-13 09:59:55,467 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2024-10-13 09:59:55,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 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-13 09:59:55,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:55,469 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] [2024-10-13 09:59:55,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:59:55,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:55,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash -750720517, now seen corresponding path program 1 times [2024-10-13 09:59:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:55,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250916253] [2024-10-13 09:59:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:55,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:56,093 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-13 09:59:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:56,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250916253] [2024-10-13 09:59:56,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250916253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510422174] [2024-10-13 09:59:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:56,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:56,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 518 [2024-10-13 09:59:56,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 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-13 09:59:56,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:56,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 518 [2024-10-13 09:59:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:57,933 INFO L124 PetriNetUnfolderBase]: 1199/6233 cut-off events. [2024-10-13 09:59:57,933 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-10-13 09:59:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 6233 events. 1199/6233 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 54396 event pairs, 864 based on Foata normal form. 0/5379 useless extension candidates. Maximal degree in co-relation 8023. Up to 1772 conditions per place. [2024-10-13 09:59:57,996 INFO L140 encePairwiseOnDemand]: 500/518 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2024-10-13 09:59:57,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2024-10-13 09:59:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-10-13 09:59:58,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2024-10-13 09:59:58,005 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2024-10-13 09:59:58,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2024-10-13 09:59:58,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:58,013 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2024-10-13 09:59:58,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2024-10-13 09:59:58,016 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-10-13 09:59:58,016 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2024-10-13 09:59:58,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 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-13 09:59:58,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:58,018 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] [2024-10-13 09:59:58,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:59:58,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1977528840, now seen corresponding path program 1 times [2024-10-13 09:59:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398372661] [2024-10-13 09:59:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:58,062 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-13 09:59:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398372661] [2024-10-13 09:59:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398372661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418922708] [2024-10-13 09:59:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:58,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:58,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-13 09:59:58,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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-13 09:59:58,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:58,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-13 09:59:58,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:58,182 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2024-10-13 09:59:58,182 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:59:58,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1674 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2024-10-13 09:59:58,193 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-10-13 09:59:58,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2024-10-13 09:59:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-13 09:59:58,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-13 09:59:58,197 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2024-10-13 09:59:58,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2024-10-13 09:59:58,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:59:58,205 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2024-10-13 09:59:58,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2024-10-13 09:59:58,207 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2024-10-13 09:59:58,207 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2024-10-13 09:59:58,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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-13 09:59:58,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:58,209 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] [2024-10-13 09:59:58,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:59:58,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:58,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1497042718, now seen corresponding path program 1 times [2024-10-13 09:59:58,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969180392] [2024-10-13 09:59:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:58,262 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-13 09:59:58,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:58,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969180392] [2024-10-13 09:59:58,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969180392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:58,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668194813] [2024-10-13 09:59:58,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:58,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:58,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:58,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-13 09:59:58,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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-13 09:59:58,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:58,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-13 09:59:58,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:58,432 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2024-10-13 09:59:58,433 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:59:58,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1312 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2024-10-13 09:59:58,442 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-10-13 09:59:58,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2024-10-13 09:59:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-13 09:59:58,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-13 09:59:58,447 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2024-10-13 09:59:58,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2024-10-13 09:59:58,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:58,456 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2024-10-13 09:59:58,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, 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=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2024-10-13 09:59:58,458 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-10-13 09:59:58,458 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2024-10-13 09:59:58,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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-13 09:59:58,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:58,460 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] [2024-10-13 09:59:58,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:59:58,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -843219424, now seen corresponding path program 1 times [2024-10-13 09:59:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580974764] [2024-10-13 09:59:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:58,545 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-13 09:59:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580974764] [2024-10-13 09:59:58,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580974764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:58,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:58,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010775966] [2024-10-13 09:59:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:58,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:58,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-13 09:59:58,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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-13 09:59:58,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:58,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-13 09:59:58,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:58,677 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2024-10-13 09:59:58,678 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:59:58,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 798 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2024-10-13 09:59:58,685 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-10-13 09:59:58,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2024-10-13 09:59:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-13 09:59:58,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-13 09:59:58,690 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2024-10-13 09:59:58,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2024-10-13 09:59:58,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:58,700 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2024-10-13 09:59:58,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2024-10-13 09:59:58,703 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2024-10-13 09:59:58,703 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2024-10-13 09:59:58,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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-13 09:59:58,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:58,706 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] [2024-10-13 09:59:58,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:59:58,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1888702319, now seen corresponding path program 1 times [2024-10-13 09:59:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833211716] [2024-10-13 09:59:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:58,783 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-13 09:59:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833211716] [2024-10-13 09:59:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833211716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728574077] [2024-10-13 09:59:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:58,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:58,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 09:59:58,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 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-13 09:59:58,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:58,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 09:59:58,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:58,930 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2024-10-13 09:59:58,931 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:59:58,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 547 events. 15/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1392 event pairs, 2 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2024-10-13 09:59:58,940 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2024-10-13 09:59:58,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2024-10-13 09:59:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2024-10-13 09:59:58,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9382239382239382 [2024-10-13 09:59:58,944 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2024-10-13 09:59:58,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2024-10-13 09:59:58,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:58,954 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2024-10-13 09:59:58,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2024-10-13 09:59:58,956 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2024-10-13 09:59:58,957 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2024-10-13 09:59:58,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 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-13 09:59:58,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:58,959 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-13 09:59:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:59:58,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:58,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1728199023, now seen corresponding path program 1 times [2024-10-13 09:59:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859562210] [2024-10-13 09:59:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:59,028 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-13 09:59:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859562210] [2024-10-13 09:59:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859562210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:59,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124793587] [2024-10-13 09:59:59,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:59,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 09:59:59,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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-13 09:59:59,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:59,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 09:59:59,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:59,276 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2024-10-13 09:59:59,276 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 09:59:59,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4659 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2024-10-13 09:59:59,289 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-10-13 09:59:59,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2024-10-13 09:59:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-10-13 09:59:59,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-13 09:59:59,292 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2024-10-13 09:59:59,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2024-10-13 09:59:59,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:59,302 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2024-10-13 09:59:59,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2024-10-13 09:59:59,305 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-10-13 09:59:59,305 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2024-10-13 09:59:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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-13 09:59:59,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:59,307 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] [2024-10-13 09:59:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:59:59,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1961587418, now seen corresponding path program 1 times [2024-10-13 09:59:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048132671] [2024-10-13 09:59:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:59,358 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-13 09:59:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048132671] [2024-10-13 09:59:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048132671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:59,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227471776] [2024-10-13 09:59:59,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:59,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:59,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:59,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 09:59:59,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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-13 09:59:59,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:59,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 09:59:59,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:59,509 INFO L124 PetriNetUnfolderBase]: 25/750 cut-off events. [2024-10-13 09:59:59,509 INFO L125 PetriNetUnfolderBase]: For 12/33 co-relation queries the response was YES. [2024-10-13 09:59:59,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 750 events. 25/750 cut-off events. For 12/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2538 event pairs, 3 based on Foata normal form. 4/686 useless extension candidates. Maximal degree in co-relation 778. Up to 21 conditions per place. [2024-10-13 09:59:59,525 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2024-10-13 09:59:59,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2024-10-13 09:59:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-10-13 09:59:59,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-10-13 09:59:59,529 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2024-10-13 09:59:59,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2024-10-13 09:59:59,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:59:59,537 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2024-10-13 09:59:59,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-10-13 09:59:59,539 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-10-13 09:59:59,539 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2024-10-13 09:59:59,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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-13 09:59:59,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:59,540 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] [2024-10-13 09:59:59,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:59:59,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 405174824, now seen corresponding path program 1 times [2024-10-13 09:59:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:59,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106129992] [2024-10-13 09:59:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:59,591 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-13 09:59:59,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:59,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106129992] [2024-10-13 09:59:59,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106129992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:59,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044396031] [2024-10-13 09:59:59,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:59,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:59,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 09:59:59,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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-13 09:59:59,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:59,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 09:59:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:59,894 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2024-10-13 09:59:59,894 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2024-10-13 09:59:59,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1869 events. 73/1869 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 11396 event pairs, 6 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 1989. Up to 93 conditions per place. [2024-10-13 09:59:59,922 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-10-13 09:59:59,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2024-10-13 09:59:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2024-10-13 09:59:59,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407979407979408 [2024-10-13 09:59:59,927 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2024-10-13 09:59:59,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2024-10-13 09:59:59,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:59,936 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2024-10-13 09:59:59,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=425, PETRI_TRANSITIONS=424} [2024-10-13 09:59:59,939 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2024-10-13 09:59:59,939 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2024-10-13 09:59:59,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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-13 09:59:59,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:59,940 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] [2024-10-13 09:59:59,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:59:59,941 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 09:59:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2061289579, now seen corresponding path program 1 times [2024-10-13 09:59:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731533773] [2024-10-13 09:59:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:00,152 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-13 10:00:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731533773] [2024-10-13 10:00:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731533773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:00:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670708390] [2024-10-13 10:00:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:00,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:00:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:00:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:00:00,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-13 10:00:00,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 424 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 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-13 10:00:00,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:00,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-13 10:00:00,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:00,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 83#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-10-13 10:00:00,920 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2024-10-13 10:00:00,920 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-13 10:00:00,920 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-13 10:00:00,920 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-13 10:00:00,921 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 83#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:00,922 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2024-10-13 10:00:00,922 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2024-10-13 10:00:00,922 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-13 10:00:00,922 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2024-10-13 10:00:00,922 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-13 10:00:00,944 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2024-10-13 10:00:00,944 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2024-10-13 10:00:00,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2025 events. 60/2025 cut-off events. For 13/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10776 event pairs, 14 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 2234. Up to 68 conditions per place. [2024-10-13 10:00:00,977 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2024-10-13 10:00:00,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2024-10-13 10:00:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:00:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 10:00:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-13 10:00:00,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-13 10:00:00,990 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2024-10-13 10:00:00,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2024-10-13 10:00:00,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:01,003 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2024-10-13 10:00:01,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2024-10-13 10:00:01,004 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-10-13 10:00:01,004 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2024-10-13 10:00:01,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 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-13 10:00:01,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:01,007 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] [2024-10-13 10:00:01,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:00:01,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:01,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash -472792529, now seen corresponding path program 1 times [2024-10-13 10:00:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266625661] [2024-10-13 10:00:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:01,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:01,066 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-13 10:00:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:01,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266625661] [2024-10-13 10:00:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266625661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:01,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566346679] [2024-10-13 10:00:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:01,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 10:00:01,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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-13 10:00:01,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:01,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 10:00:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:01,405 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2024-10-13 10:00:01,405 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2024-10-13 10:00:01,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11374 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2024-10-13 10:00:01,428 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-10-13 10:00:01,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2024-10-13 10:00:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-10-13 10:00:01,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395109395109396 [2024-10-13 10:00:01,433 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2024-10-13 10:00:01,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2024-10-13 10:00:01,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:01,443 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2024-10-13 10:00:01,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2024-10-13 10:00:01,444 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-10-13 10:00:01,445 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2024-10-13 10:00:01,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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-13 10:00:01,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:01,446 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] [2024-10-13 10:00:01,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:00:01,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:01,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1592361780, now seen corresponding path program 1 times [2024-10-13 10:00:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:01,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996360301] [2024-10-13 10:00:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:01,652 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-13 10:00:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996360301] [2024-10-13 10:00:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996360301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:01,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:00:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835924602] [2024-10-13 10:00:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:01,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:00:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:00:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:00:01,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-13 10:00:01,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 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-13 10:00:01,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:01,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-13 10:00:01,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:02,281 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2024-10-13 10:00:02,281 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2024-10-13 10:00:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7142 event pairs, 28 based on Foata normal form. 4/1396 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2024-10-13 10:00:02,309 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2024-10-13 10:00:02,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2024-10-13 10:00:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:00:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 10:00:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-13 10:00:02,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-13 10:00:02,321 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2024-10-13 10:00:02,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2024-10-13 10:00:02,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:02,332 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2024-10-13 10:00:02,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2024-10-13 10:00:02,334 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-13 10:00:02,334 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2024-10-13 10:00:02,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 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-13 10:00:02,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:02,337 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] [2024-10-13 10:00:02,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:00:02,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:02,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 357189461, now seen corresponding path program 1 times [2024-10-13 10:00:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093842539] [2024-10-13 10:00:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:02,543 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-13 10:00:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093842539] [2024-10-13 10:00:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093842539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:00:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946746437] [2024-10-13 10:00:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:02,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:00:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:00:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:00:02,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-13 10:00:02,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 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-13 10:00:02,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:02,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-13 10:00:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:03,411 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2024-10-13 10:00:03,411 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2024-10-13 10:00:03,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6960 event pairs, 29 based on Foata normal form. 3/1401 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2024-10-13 10:00:03,432 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2024-10-13 10:00:03,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2024-10-13 10:00:03,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:00:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 10:00:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-13 10:00:03,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-13 10:00:03,443 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2024-10-13 10:00:03,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2024-10-13 10:00:03,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-13 10:00:03,453 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2024-10-13 10:00:03,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2024-10-13 10:00:03,455 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2024-10-13 10:00:03,455 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2024-10-13 10:00:03,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 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-13 10:00:03,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:03,457 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] [2024-10-13 10:00:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:00:03,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1454371584, now seen corresponding path program 1 times [2024-10-13 10:00:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633520199] [2024-10-13 10:00:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:03,513 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-13 10:00:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633520199] [2024-10-13 10:00:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633520199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067446771] [2024-10-13 10:00:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:03,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:03,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:03,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 10:00:03,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 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-13 10:00:03,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:03,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 10:00:03,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:03,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L68-->L68-1: Formula: (= |v_#race~csum~0_4| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_4|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 302#L68-1true, 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 547#(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: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 282#L87true, 528#(= |#race~A~0| 0), Black: 533#true, 581#true, 562#true]) [2024-10-13 10:00:03,721 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-10-13 10:00:03,721 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-10-13 10:00:03,721 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-10-13 10:00:03,722 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-10-13 10:00:03,737 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2024-10-13 10:00:03,738 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2024-10-13 10:00:03,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4399 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2024-10-13 10:00:03,754 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2024-10-13 10:00:03,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2024-10-13 10:00:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-10-13 10:00:03,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-10-13 10:00:03,758 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2024-10-13 10:00:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2024-10-13 10:00:03,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-13 10:00:03,767 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2024-10-13 10:00:03,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2024-10-13 10:00:03,770 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-10-13 10:00:03,770 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2024-10-13 10:00:03,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 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-13 10:00:03,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:03,771 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] [2024-10-13 10:00:03,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:00:03,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:03,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash -728454956, now seen corresponding path program 1 times [2024-10-13 10:00:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620778857] [2024-10-13 10:00:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:03,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:04,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:04,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620778857] [2024-10-13 10:00:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620778857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:04,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:04,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403001825] [2024-10-13 10:00:04,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:04,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:04,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-13 10:00:04,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 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-13 10:00:04,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:04,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-13 10:00:04,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:05,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(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|)), 600#true, Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), 282#L87true, 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 39#L67-27true, 528#(= |#race~A~0| 0), Black: 533#true, 562#true]) [2024-10-13 10:00:05,279 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-10-13 10:00:05,279 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-13 10:00:05,279 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:05,280 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:05,500 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(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: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 282#L87true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0), 562#true]) [2024-10-13 10:00:05,500 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-13 10:00:05,500 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-10-13 10:00:05,500 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-13 10:00:05,500 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:05,500 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:05,511 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2024-10-13 10:00:05,511 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2024-10-13 10:00:05,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 25936 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2024-10-13 10:00:05,561 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2024-10-13 10:00:05,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2024-10-13 10:00:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-10-13 10:00:05,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-13 10:00:05,568 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2024-10-13 10:00:05,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2024-10-13 10:00:05,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-10-13 10:00:05,579 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2024-10-13 10:00:05,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2024-10-13 10:00:05,580 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-10-13 10:00:05,581 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2024-10-13 10:00:05,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 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-13 10:00:05,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:05,582 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] [2024-10-13 10:00:05,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:00:05,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:05,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2090320587, now seen corresponding path program 1 times [2024-10-13 10:00:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:05,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142539225] [2024-10-13 10:00:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142539225] [2024-10-13 10:00:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142539225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:06,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757733620] [2024-10-13 10:00:06,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:06,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:06,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:06,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-13 10:00:06,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 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-13 10:00:06,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:06,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-13 10:00:06,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:08,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][286], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 558#true, Black: 526#true, 603#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 202#L59-3true]) [2024-10-13 10:00:08,041 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-10-13 10:00:08,041 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:08,041 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-10-13 10:00:08,042 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:08,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 145#L62true, Black: 547#(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: 526#true, Black: 558#true, 603#true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:08,710 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-10-13 10:00:08,710 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-13 10:00:08,710 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-10-13 10:00:08,711 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-10-13 10:00:08,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 558#true, Black: 526#true, 603#true, 507#(= |#race~N~0| 0), 282#L87true, 39#L67-27true, 528#(= |#race~A~0| 0), Black: 533#true]) [2024-10-13 10:00:08,749 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-13 10:00:08,749 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:08,749 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-13 10:00:08,749 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:08,904 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2024-10-13 10:00:08,905 INFO L125 PetriNetUnfolderBase]: For 1656/1738 co-relation queries the response was YES. [2024-10-13 10:00:08,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1656/1738 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 171997 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2024-10-13 10:00:09,049 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2024-10-13 10:00:09,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2024-10-13 10:00:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-10-13 10:00:09,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-13 10:00:09,055 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2024-10-13 10:00:09,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2024-10-13 10:00:09,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:09,074 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2024-10-13 10:00:09,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2024-10-13 10:00:09,075 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2024-10-13 10:00:09,075 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2024-10-13 10:00:09,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 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-13 10:00:09,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:09,077 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] [2024-10-13 10:00:09,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:00:09,077 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:09,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1264112148, now seen corresponding path program 1 times [2024-10-13 10:00:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633998719] [2024-10-13 10:00:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633998719] [2024-10-13 10:00:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633998719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:09,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:09,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161909136] [2024-10-13 10:00:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:09,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:10,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-13 10:00:10,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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-13 10:00:10,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:10,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-13 10:00:10,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:12,474 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2024-10-13 10:00:12,474 INFO L125 PetriNetUnfolderBase]: For 3742/3852 co-relation queries the response was YES. [2024-10-13 10:00:12,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3742/3852 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 136360 event pairs, 132 based on Foata normal form. 0/11312 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2024-10-13 10:00:12,670 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2024-10-13 10:00:12,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2024-10-13 10:00:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-10-13 10:00:12,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-10-13 10:00:12,684 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2024-10-13 10:00:12,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2024-10-13 10:00:12,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:12,703 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2024-10-13 10:00:12,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2024-10-13 10:00:12,704 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2024-10-13 10:00:12,704 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2024-10-13 10:00:12,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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-13 10:00:12,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:12,706 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-13 10:00:12,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:00:12,706 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash -621426886, now seen corresponding path program 1 times [2024-10-13 10:00:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883818931] [2024-10-13 10:00:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883818931] [2024-10-13 10:00:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883818931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022153861] [2024-10-13 10:00:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:13,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-13 10:00:13,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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-13 10:00:13,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:13,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-13 10:00:13,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:15,689 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2024-10-13 10:00:15,690 INFO L125 PetriNetUnfolderBase]: For 4433/4543 co-relation queries the response was YES. [2024-10-13 10:00:15,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4433/4543 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 135088 event pairs, 132 based on Foata normal form. 0/11296 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2024-10-13 10:00:15,795 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2024-10-13 10:00:15,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2024-10-13 10:00:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-10-13 10:00:15,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-10-13 10:00:15,802 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2024-10-13 10:00:15,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2024-10-13 10:00:15,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:15,821 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2024-10-13 10:00:15,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2024-10-13 10:00:15,822 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-10-13 10:00:15,823 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2024-10-13 10:00:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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-13 10:00:15,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:15,824 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] [2024-10-13 10:00:15,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:00:15,824 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -237480508, now seen corresponding path program 1 times [2024-10-13 10:00:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:15,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333007743] [2024-10-13 10:00:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:15,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:15,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333007743] [2024-10-13 10:00:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333007743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:15,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049087910] [2024-10-13 10:00:15,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:15,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:15,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:15,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:15,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 10:00:15,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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-13 10:00:15,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:15,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 10:00:15,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:18,095 INFO L124 PetriNetUnfolderBase]: 884/10875 cut-off events. [2024-10-13 10:00:18,095 INFO L125 PetriNetUnfolderBase]: For 2300/2408 co-relation queries the response was YES. [2024-10-13 10:00:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 10875 events. 884/10875 cut-off events. For 2300/2408 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 115890 event pairs, 71 based on Foata normal form. 1/10088 useless extension candidates. Maximal degree in co-relation 14842. Up to 727 conditions per place. [2024-10-13 10:00:18,184 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-10-13 10:00:18,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2024-10-13 10:00:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-10-13 10:00:18,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-10-13 10:00:18,188 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2024-10-13 10:00:18,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2024-10-13 10:00:18,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:18,205 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2024-10-13 10:00:18,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2024-10-13 10:00:18,208 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2024-10-13 10:00:18,208 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2024-10-13 10:00:18,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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-13 10:00:18,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:18,209 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] [2024-10-13 10:00:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:00:18,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1878527003, now seen corresponding path program 1 times [2024-10-13 10:00:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428926617] [2024-10-13 10:00:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428926617] [2024-10-13 10:00:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428926617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:18,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804342484] [2024-10-13 10:00:18,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:18,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-13 10:00:18,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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-13 10:00:18,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:18,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-13 10:00:18,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:20,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][278], [560#(= |#race~C~0| 0), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 640#true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 637#true, 603#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 202#L59-3true]) [2024-10-13 10:00:20,205 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-10-13 10:00:20,205 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:20,205 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-10-13 10:00:20,205 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:20,456 INFO L124 PetriNetUnfolderBase]: 997/11923 cut-off events. [2024-10-13 10:00:20,456 INFO L125 PetriNetUnfolderBase]: For 1884/1985 co-relation queries the response was YES. [2024-10-13 10:00:20,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15866 conditions, 11923 events. 997/11923 cut-off events. For 1884/1985 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 131773 event pairs, 90 based on Foata normal form. 0/11080 useless extension candidates. Maximal degree in co-relation 15821. Up to 781 conditions per place. [2024-10-13 10:00:20,575 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2024-10-13 10:00:20,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2024-10-13 10:00:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-10-13 10:00:20,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-10-13 10:00:20,579 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2024-10-13 10:00:20,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2024-10-13 10:00:20,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:20,597 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2024-10-13 10:00:20,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2024-10-13 10:00:20,599 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2024-10-13 10:00:20,599 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2024-10-13 10:00:20,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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-13 10:00:20,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:20,600 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] [2024-10-13 10:00:20,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:00:20,601 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:20,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1527746212, now seen corresponding path program 1 times [2024-10-13 10:00:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:20,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929719185] [2024-10-13 10:00:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:20,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929719185] [2024-10-13 10:00:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929719185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:21,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110772107] [2024-10-13 10:00:21,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:21,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:21,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 518 [2024-10-13 10:00:21,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 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-13 10:00:21,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:21,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 518 [2024-10-13 10:00:21,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:27,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][535], [560#(= |#race~C~0| 0), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 418#L85-4true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 640#true, 210#L51-10true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 603#true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0), 89#L59-10true]) [2024-10-13 10:00:27,589 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-10-13 10:00:27,589 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-10-13 10:00:27,589 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-10-13 10:00:27,589 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-10-13 10:00:27,752 INFO L124 PetriNetUnfolderBase]: 6087/33187 cut-off events. [2024-10-13 10:00:27,752 INFO L125 PetriNetUnfolderBase]: For 11985/12100 co-relation queries the response was YES. [2024-10-13 10:00:28,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55262 conditions, 33187 events. 6087/33187 cut-off events. For 11985/12100 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 406902 event pairs, 2256 based on Foata normal form. 0/31176 useless extension candidates. Maximal degree in co-relation 55216. Up to 8927 conditions per place. [2024-10-13 10:00:28,120 INFO L140 encePairwiseOnDemand]: 503/518 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2024-10-13 10:00:28,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2024-10-13 10:00:28,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2024-10-13 10:00:28,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844916344916345 [2024-10-13 10:00:28,125 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2024-10-13 10:00:28,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2024-10-13 10:00:28,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:28,186 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2024-10-13 10:00:28,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2024-10-13 10:00:28,188 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-13 10:00:28,188 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2024-10-13 10:00:28,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 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-13 10:00:28,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:28,189 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] [2024-10-13 10:00:28,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:00:28,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1150734015, now seen corresponding path program 1 times [2024-10-13 10:00:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226485252] [2024-10-13 10:00:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226485252] [2024-10-13 10:00:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226485252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:30,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-13 10:00:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644950379] [2024-10-13 10:00:30,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:00:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:30,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:00:30,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:00:33,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-10-13 10:00:33,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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-13 10:00:33,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:33,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-10-13 10:00:33,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:41,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), 428#L67-10true, Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(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)), Black: 558#true, 282#L87true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:41,192 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-10-13 10:00:41,192 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:41,192 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-13 10:00:41,192 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-13 10:00:42,057 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), 428#L67-10true, Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(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)), 282#L87true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:42,057 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-10-13 10:00:42,057 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:42,057 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-13 10:00:42,057 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-10-13 10:00:42,057 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-13 10:00:44,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 387#L54true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(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)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 89#L59-10true]) [2024-10-13 10:00:44,983 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-10-13 10:00:44,983 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-10-13 10:00:44,983 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-10-13 10:00:44,984 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-10-13 10:00:45,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L67-10-->L67-11: Formula: (= |v_#race~B~0_4| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_4|} AuxVars[] AssignedVars[#race~B~0][285], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 202#L59-3true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(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)), Black: 558#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 384#L50-7true]) [2024-10-13 10:00:45,087 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-10-13 10:00:45,087 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-10-13 10:00:45,087 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-10-13 10:00:45,087 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-10-13 10:00:45,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(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)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 89#L59-10true]) [2024-10-13 10:00:45,229 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-10-13 10:00:45,229 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-10-13 10:00:45,229 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-10-13 10:00:45,230 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-10-13 10:00:47,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L67-28-->L67-29: Formula: (= (store |v_#race_46| v_~C~0.base_4 (store (select |v_#race_46| v_~C~0.base_4) (+ 2 v_~C~0.offset_4 (* |v_thread3Thread1of1ForFork2_~i~2#1_43| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_7|)) |v_#race_45|) InVars {#race=|v_#race_46|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_4, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} OutVars{#race=|v_#race_45|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_4, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} AuxVars[] AssignedVars[#race][578], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 210#L51-10true, Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 393#L67-29true, 142#L58-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (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) (= (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))]) [2024-10-13 10:00:47,465 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2024-10-13 10:00:47,465 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-10-13 10:00:47,465 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-10-13 10:00:47,465 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(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)), 487#L59-8true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:47,500 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 387#L54true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(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)), 487#L59-8true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:47,500 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-13 10:00:47,500 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-13 10:00:47,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L67-29-->L67-30: Formula: (= (store |v_#race_48| v_~C~0.base_5 (store (select |v_#race_48| v_~C~0.base_5) (+ 3 v_~C~0.offset_5 (* |v_thread3Thread1of1ForFork2_~i~2#1_45| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_9|)) |v_#race_47|) InVars {#race=|v_#race_48|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} OutVars{#race=|v_#race_47|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} AuxVars[] AssignedVars[#race][596], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 210#L51-10true, Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 142#L58-7true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 380#L67-30true, 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (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) (= (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))]) [2024-10-13 10:00:47,508 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-10-13 10:00:47,508 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-13 10:00:47,508 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-13 10:00:47,508 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-13 10:00:47,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 80#L59-9true, 387#L54true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(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)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:47,532 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2024-10-13 10:00:47,532 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:47,532 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-13 10:00:47,532 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-13 10:00:47,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 80#L59-9true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(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)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:47,532 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-10-13 10:00:47,533 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-10-13 10:00:47,533 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-10-13 10:00:47,533 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-10-13 10:00:47,753 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2024-10-13 10:00:47,753 INFO L125 PetriNetUnfolderBase]: For 49248/54923 co-relation queries the response was YES. [2024-10-13 10:00:48,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49248/54923 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 931327 event pairs, 1041 based on Foata normal form. 501/61132 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2024-10-13 10:00:48,753 INFO L140 encePairwiseOnDemand]: 483/518 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2024-10-13 10:00:48,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2024-10-13 10:00:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 10:00:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-13 10:00:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2024-10-13 10:00:48,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.830719111969112 [2024-10-13 10:00:48,770 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2024-10-13 10:00:48,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2024-10-13 10:00:49,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:49,051 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2024-10-13 10:00:49,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2024-10-13 10:00:49,052 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2024-10-13 10:00:49,052 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2024-10-13 10:00:49,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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-13 10:00:49,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:49,055 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] [2024-10-13 10:00:49,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:00:49,056 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-13 10:00:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -528468227, now seen corresponding path program 2 times [2024-10-13 10:00:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006634208] [2024-10-13 10:00:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:00:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006634208] [2024-10-13 10:00:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006634208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-13 10:00:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610838017] [2024-10-13 10:00:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:00:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:00:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:00:54,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-10-13 10:00:54,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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-13 10:00:54,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:54,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-10-13 10:00:54,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:57,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][291], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 723#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (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)), 799#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (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)), Black: 721#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (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)), Black: 727#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (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) (= (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: 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (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) (= (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)), 202#L59-3true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 387#L54true, Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(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)), Black: 558#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:57,784 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2024-10-13 10:00:57,784 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-13 10:00:57,784 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-10-13 10:00:57,785 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-10-13 10:00:58,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][291], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 723#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (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)), 799#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (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)), Black: 533#true, Black: 721#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (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)), Black: 727#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (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) (= (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: 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (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) (= (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)), 202#L59-3true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(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: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(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)), 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-13 10:00:58,305 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2024-10-13 10:00:58,305 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-13 10:00:58,305 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-13 10:00:58,305 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event