./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-assert-order-craig-3061b6d-m [2024-11-19 05:59:18,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:59:18,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:59:18,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:59:18,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:59:18,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:59:18,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:59:18,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:59:18,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:59:18,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:59:18,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:59:18,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:59:18,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:59:18,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:59:18,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:59:18,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:59:18,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:59:18,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:59:18,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:59:18,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:59:18,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:59:18,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:59:18,939 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:59:18,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:59:18,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:59:18,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:59:18,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:59:18,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:59:18,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:59:18,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:59:18,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:59:18,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:18,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:59:18,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:59:18,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:59:18,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:59:18,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:59:18,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:59:18,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:59:18,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:59:18,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:59:18,946 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-11-19 05:59:19,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:59:19,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:59:19,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:59:19,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:59:19,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:59:19,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-11-19 05:59:20,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:59:20,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:59:20,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-11-19 05:59:20,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64429af06/559e57b49c764d6aa285852f05a891b8/FLAG4d72b6951 [2024-11-19 05:59:20,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64429af06/559e57b49c764d6aa285852f05a891b8 [2024-11-19 05:59:20,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:59:20,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:59:20,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:20,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:59:20,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:59:20,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292c30e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20, skipping insertion in model container [2024-11-19 05:59:20,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:59:20,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:20,796 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:59:20,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:20,836 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:59:20,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20 WrapperNode [2024-11-19 05:59:20,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:20,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:20,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:59:20,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:59:20,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,888 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 384 [2024-11-19 05:59:20,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:20,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:59:20,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:59:20,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:59:20,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:59:20,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:59:20,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:59:20,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:59:20,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (1/1) ... [2024-11-19 05:59:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:20,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:59:20,967 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-11-19 05:59:20,970 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-11-19 05:59:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:59:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:59:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:59:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:59:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:59:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:59:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:59:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:59:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:59:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:59:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:59:21,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:59:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:59:21,020 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:59:21,141 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:59:21,143 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:59:21,666 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:59:21,666 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:59:21,690 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:59:21,690 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:59:21,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:21 BoogieIcfgContainer [2024-11-19 05:59:21,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:59:21,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:59:21,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:59:21,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:59:21,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:59:20" (1/3) ... [2024-11-19 05:59:21,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184eb401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:21, skipping insertion in model container [2024-11-19 05:59:21,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:20" (2/3) ... [2024-11-19 05:59:21,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184eb401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:21, skipping insertion in model container [2024-11-19 05:59:21,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:21" (3/3) ... [2024-11-19 05:59:21,699 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-11-19 05:59:21,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:59:21,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-19 05:59:21,713 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:59:21,862 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:59:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 518 transitions, 1057 flow [2024-11-19 05:59:22,049 INFO L124 PetriNetUnfolderBase]: 29/515 cut-off events. [2024-11-19 05:59:22,051 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:59:22,063 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-11-19 05:59:22,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 518 transitions, 1057 flow [2024-11-19 05:59:22,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 471 transitions, 960 flow [2024-11-19 05:59:22,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:59:22,089 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;@6d01e83d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:59:22,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-19 05:59:22,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:59:22,092 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-19 05:59:22,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:59:22,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:22,093 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-11-19 05:59:22,094 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-11-19 05:59:22,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -97437285, now seen corresponding path program 1 times [2024-11-19 05:59:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988612673] [2024-11-19 05:59:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988612673] [2024-11-19 05:59:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988612673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:22,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:22,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:22,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933799041] [2024-11-19 05:59:22,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:22,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:22,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:22,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 518 [2024-11-19 05:59:22,399 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-11-19 05:59:22,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:22,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 518 [2024-11-19 05:59:22,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:22,583 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2024-11-19 05:59:22,584 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 05:59:22,595 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-11-19 05:59:22,602 INFO L140 encePairwiseOnDemand]: 495/518 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2024-11-19 05:59:22,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2024-11-19 05:59:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-11-19 05:59:22,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-11-19 05:59:22,625 INFO L175 Difference]: Start difference. First operand has 455 places, 471 transitions, 960 flow. Second operand 3 states and 1463 transitions. [2024-11-19 05:59:22,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2024-11-19 05:59:22,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:59:22,668 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2024-11-19 05:59:22,670 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-11-19 05:59:22,674 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-19 05:59:22,674 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2024-11-19 05:59:22,675 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-11-19 05:59:22,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:22,676 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-11-19 05:59:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:59:22,677 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-11-19 05:59:22,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1490081496, now seen corresponding path program 1 times [2024-11-19 05:59:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:22,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803990256] [2024-11-19 05:59:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:22,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:22,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803990256] [2024-11-19 05:59:22,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803990256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799384661] [2024-11-19 05:59:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:22,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:22,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:22,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:22,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 518 [2024-11-19 05:59:22,763 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-11-19 05:59:22,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:22,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 518 [2024-11-19 05:59:22,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:23,126 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2024-11-19 05:59:23,127 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:59:23,137 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-11-19 05:59:23,145 INFO L140 encePairwiseOnDemand]: 511/518 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2024-11-19 05:59:23,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2024-11-19 05:59:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-11-19 05:59:23,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-11-19 05:59:23,150 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2024-11-19 05:59:23,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2024-11-19 05:59:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:23,156 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2024-11-19 05:59:23,156 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-11-19 05:59:23,157 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-19 05:59:23,157 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2024-11-19 05:59:23,158 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-11-19 05:59:23,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:23,159 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-11-19 05:59:23,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:59:23,159 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-11-19 05:59:23,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash -750720517, now seen corresponding path program 1 times [2024-11-19 05:59:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049847373] [2024-11-19 05:59:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049847373] [2024-11-19 05:59:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049847373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205612565] [2024-11-19 05:59:23,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:23,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:23,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:23,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:23,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 518 [2024-11-19 05:59:23,919 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-11-19 05:59:23,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:23,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 518 [2024-11-19 05:59:23,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:24,808 INFO L124 PetriNetUnfolderBase]: 1199/6233 cut-off events. [2024-11-19 05:59:24,809 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-11-19 05:59:24,827 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-11-19 05:59:24,856 INFO L140 encePairwiseOnDemand]: 500/518 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2024-11-19 05:59:24,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2024-11-19 05:59:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-11-19 05:59:24,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2024-11-19 05:59:24,861 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2024-11-19 05:59:24,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2024-11-19 05:59:24,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:24,867 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2024-11-19 05:59:24,868 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-11-19 05:59:24,869 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-11-19 05:59:24,870 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2024-11-19 05:59:24,871 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-11-19 05:59:24,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:24,871 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-11-19 05:59:24,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:59:24,872 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-11-19 05:59:24,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:24,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1977528840, now seen corresponding path program 1 times [2024-11-19 05:59:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849273275] [2024-11-19 05:59:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:24,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849273275] [2024-11-19 05:59:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849273275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:24,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:24,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:24,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929371101] [2024-11-19 05:59:24,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:24,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:24,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-19 05:59:24,922 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-11-19 05:59:24,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:24,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-19 05:59:24,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,041 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2024-11-19 05:59:25,041 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:59:25,045 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-11-19 05:59:25,049 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-11-19 05:59:25,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2024-11-19 05:59:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-19 05:59:25,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-19 05:59:25,053 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2024-11-19 05:59:25,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2024-11-19 05:59:25,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:25,059 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2024-11-19 05:59:25,059 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-11-19 05:59:25,061 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2024-11-19 05:59:25,061 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2024-11-19 05:59:25,062 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-11-19 05:59:25,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,063 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-11-19 05:59:25,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:59:25,063 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-11-19 05:59:25,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1497042718, now seen corresponding path program 1 times [2024-11-19 05:59:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514905917] [2024-11-19 05:59:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:25,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514905917] [2024-11-19 05:59:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514905917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:25,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:25,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:25,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622718265] [2024-11-19 05:59:25,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:25,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:25,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:25,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-19 05:59:25,123 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-11-19 05:59:25,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:25,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-19 05:59:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,182 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2024-11-19 05:59:25,182 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:59:25,185 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-11-19 05:59:25,189 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-11-19 05:59:25,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2024-11-19 05:59:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-19 05:59:25,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-19 05:59:25,193 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2024-11-19 05:59:25,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2024-11-19 05:59:25,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:25,198 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2024-11-19 05:59:25,199 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-11-19 05:59:25,200 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-11-19 05:59:25,201 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2024-11-19 05:59:25,202 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-11-19 05:59:25,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,202 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-11-19 05:59:25,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:59:25,202 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-11-19 05:59:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash -843219424, now seen corresponding path program 1 times [2024-11-19 05:59:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412259812] [2024-11-19 05:59:25,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412259812] [2024-11-19 05:59:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412259812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:25,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084982504] [2024-11-19 05:59:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:25,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:25,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-19 05:59:25,272 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-11-19 05:59:25,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:25,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-19 05:59:25,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,331 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2024-11-19 05:59:25,332 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:59:25,334 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-11-19 05:59:25,336 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-11-19 05:59:25,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2024-11-19 05:59:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-19 05:59:25,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-19 05:59:25,339 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2024-11-19 05:59:25,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2024-11-19 05:59:25,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:25,344 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2024-11-19 05:59:25,345 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-11-19 05:59:25,346 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2024-11-19 05:59:25,347 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2024-11-19 05:59:25,348 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-11-19 05:59:25,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,348 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-11-19 05:59:25,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:59:25,348 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-11-19 05:59:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1888702319, now seen corresponding path program 1 times [2024-11-19 05:59:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312816940] [2024-11-19 05:59:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:25,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312816940] [2024-11-19 05:59:25,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312816940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:25,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:25,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278373063] [2024-11-19 05:59:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:25,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:25,410 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-11-19 05:59:25,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:25,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:25,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,468 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2024-11-19 05:59:25,469 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:59:25,472 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-11-19 05:59:25,475 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2024-11-19 05:59:25,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2024-11-19 05:59:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2024-11-19 05:59:25,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9382239382239382 [2024-11-19 05:59:25,478 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2024-11-19 05:59:25,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2024-11-19 05:59:25,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:25,483 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2024-11-19 05:59:25,484 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-11-19 05:59:25,485 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2024-11-19 05:59:25,485 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2024-11-19 05:59:25,486 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-11-19 05:59:25,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,487 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-11-19 05:59:25,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:59:25,487 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-11-19 05:59:25,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1728199023, now seen corresponding path program 1 times [2024-11-19 05:59:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640111590] [2024-11-19 05:59:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640111590] [2024-11-19 05:59:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640111590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048161744] [2024-11-19 05:59:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:25,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:25,545 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-11-19 05:59:25,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:25,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,707 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2024-11-19 05:59:25,708 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:59:25,715 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-11-19 05:59:25,719 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-11-19 05:59:25,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2024-11-19 05:59:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-11-19 05:59:25,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-11-19 05:59:25,722 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2024-11-19 05:59:25,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2024-11-19 05:59:25,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:25,731 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2024-11-19 05:59:25,732 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-11-19 05:59:25,734 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-11-19 05:59:25,735 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2024-11-19 05:59:25,735 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-11-19 05:59:25,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,736 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-11-19 05:59:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:59:25,737 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-11-19 05:59:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1961587418, now seen corresponding path program 1 times [2024-11-19 05:59:25,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465225062] [2024-11-19 05:59:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465225062] [2024-11-19 05:59:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465225062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:25,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843497155] [2024-11-19 05:59:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:25,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:25,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:25,808 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-11-19 05:59:25,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:25,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:25,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,936 INFO L124 PetriNetUnfolderBase]: 25/750 cut-off events. [2024-11-19 05:59:25,938 INFO L125 PetriNetUnfolderBase]: For 12/33 co-relation queries the response was YES. [2024-11-19 05:59:25,944 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-11-19 05:59:25,947 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2024-11-19 05:59:25,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2024-11-19 05:59:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-11-19 05:59:25,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-11-19 05:59:25,951 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2024-11-19 05:59:25,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2024-11-19 05:59:25,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:25,958 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2024-11-19 05:59:25,958 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-11-19 05:59:25,960 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-11-19 05:59:25,960 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2024-11-19 05:59:25,961 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-11-19 05:59:25,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,961 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-11-19 05:59:25,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:59:25,962 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-11-19 05:59:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash 405174824, now seen corresponding path program 1 times [2024-11-19 05:59:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523508093] [2024-11-19 05:59:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523508093] [2024-11-19 05:59:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523508093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932942751] [2024-11-19 05:59:26,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:26,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:26,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:26,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:26,021 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-11-19 05:59:26,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:26,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:26,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:26,241 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2024-11-19 05:59:26,241 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2024-11-19 05:59:26,249 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-11-19 05:59:26,253 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-11-19 05:59:26,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2024-11-19 05:59:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2024-11-19 05:59:26,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407979407979408 [2024-11-19 05:59:26,256 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2024-11-19 05:59:26,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2024-11-19 05:59:26,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:26,261 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2024-11-19 05:59:26,262 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-11-19 05:59:26,262 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2024-11-19 05:59:26,263 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2024-11-19 05:59:26,263 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-11-19 05:59:26,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:26,264 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-11-19 05:59:26,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:59:26,264 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-11-19 05:59:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2061289579, now seen corresponding path program 1 times [2024-11-19 05:59:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:26,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081494070] [2024-11-19 05:59:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:26,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:26,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:26,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081494070] [2024-11-19 05:59:26,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081494070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:26,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:59:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207108601] [2024-11-19 05:59:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:26,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:59:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:59:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:59:26,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-19 05:59:26,629 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-11-19 05:59:26,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:26,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-19 05:59:26,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:26,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_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-11-19 05:59:26,939 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2024-11-19 05:59:26,940 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-19 05:59:26,940 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-19 05:59:26,940 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-19 05:59:26,940 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_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-11-19 05:59:26,940 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2024-11-19 05:59:26,941 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2024-11-19 05:59:26,941 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-19 05:59:26,941 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2024-11-19 05:59:26,941 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-19 05:59:26,955 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2024-11-19 05:59:26,956 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2024-11-19 05:59:26,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-11-19 05:59:26,975 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2024-11-19 05:59:26,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2024-11-19 05:59:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:59:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 05:59:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-19 05:59:26,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-19 05:59:26,982 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2024-11-19 05:59:26,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2024-11-19 05:59:26,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:26,988 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2024-11-19 05:59:26,989 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-11-19 05:59:26,989 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-19 05:59:26,989 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2024-11-19 05:59:26,991 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-11-19 05:59:26,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:26,991 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-11-19 05:59:26,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:59:26,992 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-11-19 05:59:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -472792529, now seen corresponding path program 1 times [2024-11-19 05:59:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645210501] [2024-11-19 05:59:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645210501] [2024-11-19 05:59:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645210501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104332550] [2024-11-19 05:59:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:27,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:27,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:27,056 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-11-19 05:59:27,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:27,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:27,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:27,281 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2024-11-19 05:59:27,282 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2024-11-19 05:59:27,292 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-11-19 05:59:27,297 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-11-19 05:59:27,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2024-11-19 05:59:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-11-19 05:59:27,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395109395109396 [2024-11-19 05:59:27,301 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2024-11-19 05:59:27,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2024-11-19 05:59:27,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:27,308 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2024-11-19 05:59:27,308 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-11-19 05:59:27,309 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-11-19 05:59:27,309 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2024-11-19 05:59:27,310 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-11-19 05:59:27,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:27,310 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-11-19 05:59:27,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:59:27,310 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-11-19 05:59:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1592361780, now seen corresponding path program 1 times [2024-11-19 05:59:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:27,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906438316] [2024-11-19 05:59:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906438316] [2024-11-19 05:59:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906438316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:27,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:59:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816749127] [2024-11-19 05:59:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:27,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:59:27,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:27,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:59:27,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:59:27,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-19 05:59:27,644 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-11-19 05:59:27,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:27,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-19 05:59:27,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:27,926 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2024-11-19 05:59:27,926 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2024-11-19 05:59:27,933 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-11-19 05:59:27,937 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2024-11-19 05:59:27,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2024-11-19 05:59:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:59:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 05:59:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-19 05:59:27,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-19 05:59:27,944 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2024-11-19 05:59:27,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2024-11-19 05:59:27,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:27,952 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2024-11-19 05:59:27,952 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-11-19 05:59:27,953 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-19 05:59:27,953 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2024-11-19 05:59:27,955 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-11-19 05:59:27,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:27,955 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-11-19 05:59:27,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:59:27,955 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-11-19 05:59:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 357189461, now seen corresponding path program 1 times [2024-11-19 05:59:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268977345] [2024-11-19 05:59:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268977345] [2024-11-19 05:59:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268977345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:59:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345947605] [2024-11-19 05:59:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:59:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:59:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:59:28,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-19 05:59:28,381 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-11-19 05:59:28,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:28,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-19 05:59:28,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:28,644 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2024-11-19 05:59:28,644 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2024-11-19 05:59:28,654 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-11-19 05:59:28,658 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2024-11-19 05:59:28,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2024-11-19 05:59:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:59:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 05:59:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-19 05:59:28,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-19 05:59:28,665 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2024-11-19 05:59:28,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2024-11-19 05:59:28,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:59:28,672 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2024-11-19 05:59:28,673 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-11-19 05:59:28,673 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2024-11-19 05:59:28,673 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2024-11-19 05:59:28,675 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-11-19 05:59:28,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:28,675 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-11-19 05:59:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:59:28,675 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-11-19 05:59:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1454371584, now seen corresponding path program 1 times [2024-11-19 05:59:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025861465] [2024-11-19 05:59:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:28,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025861465] [2024-11-19 05:59:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025861465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880479363] [2024-11-19 05:59:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:28,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:28,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:28,718 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-11-19 05:59:28,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:28,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:28,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:28,891 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-11-19 05:59:28,891 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-19 05:59:28,892 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-19 05:59:28,892 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-19 05:59:28,892 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-19 05:59:28,905 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2024-11-19 05:59:28,905 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2024-11-19 05:59:28,911 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-11-19 05:59:28,913 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2024-11-19 05:59:28,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2024-11-19 05:59:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-11-19 05:59:28,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-11-19 05:59:28,917 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2024-11-19 05:59:28,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2024-11-19 05:59:28,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:59:28,924 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2024-11-19 05:59:28,925 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-11-19 05:59:28,925 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-11-19 05:59:28,925 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2024-11-19 05:59:28,926 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-11-19 05:59:28,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:28,926 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-11-19 05:59:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:59:28,927 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-11-19 05:59:28,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -728454956, now seen corresponding path program 1 times [2024-11-19 05:59:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957906532] [2024-11-19 05:59:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957906532] [2024-11-19 05:59:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957906532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327148674] [2024-11-19 05:59:29,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:29,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:29,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:29,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-19 05:59:29,667 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-11-19 05:59:29,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:29,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-19 05:59:29,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:30,029 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-11-19 05:59:30,029 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-11-19 05:59:30,029 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-19 05:59:30,030 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 05:59:30,030 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 05:59:30,178 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-11-19 05:59:30,178 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-19 05:59:30,178 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-19 05:59:30,178 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-19 05:59:30,178 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 05:59:30,179 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 05:59:30,190 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2024-11-19 05:59:30,190 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2024-11-19 05:59:30,214 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-11-19 05:59:30,223 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2024-11-19 05:59:30,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2024-11-19 05:59:30,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-11-19 05:59:30,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-19 05:59:30,228 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2024-11-19 05:59:30,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2024-11-19 05:59:30,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-11-19 05:59:30,235 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2024-11-19 05:59:30,236 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-11-19 05:59:30,236 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-11-19 05:59:30,236 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2024-11-19 05:59:30,237 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-11-19 05:59:30,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:30,237 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-11-19 05:59:30,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:59:30,238 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-11-19 05:59:30,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2090320587, now seen corresponding path program 1 times [2024-11-19 05:59:30,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:30,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842294403] [2024-11-19 05:59:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:30,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:30,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842294403] [2024-11-19 05:59:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842294403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:30,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:30,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:30,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874032992] [2024-11-19 05:59:30,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:30,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:30,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:30,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-19 05:59:30,895 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-11-19 05:59:30,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:30,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-19 05:59:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:32,151 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-11-19 05:59:32,152 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-19 05:59:32,152 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 05:59:32,152 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-19 05:59:32,152 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 05:59:32,850 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-11-19 05:59:32,850 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-11-19 05:59:32,850 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-19 05:59:32,850 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 05:59:32,850 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 05:59:32,896 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-11-19 05:59:32,896 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-19 05:59:32,897 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 05:59:32,897 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-19 05:59:32,897 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 05:59:33,069 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2024-11-19 05:59:33,070 INFO L125 PetriNetUnfolderBase]: For 1656/1738 co-relation queries the response was YES. [2024-11-19 05:59:33,127 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-11-19 05:59:33,168 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2024-11-19 05:59:33,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2024-11-19 05:59:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-11-19 05:59:33,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-19 05:59:33,173 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2024-11-19 05:59:33,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2024-11-19 05:59:33,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:33,184 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2024-11-19 05:59:33,185 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-11-19 05:59:33,185 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2024-11-19 05:59:33,185 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2024-11-19 05:59:33,186 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-11-19 05:59:33,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:33,187 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-11-19 05:59:33,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:59:33,187 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-11-19 05:59:33,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1264112148, now seen corresponding path program 1 times [2024-11-19 05:59:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:33,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479231148] [2024-11-19 05:59:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:33,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:33,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479231148] [2024-11-19 05:59:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479231148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:33,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:33,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386463011] [2024-11-19 05:59:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:33,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:33,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-19 05:59:33,896 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-11-19 05:59:33,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:33,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-19 05:59:33,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:35,813 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2024-11-19 05:59:35,814 INFO L125 PetriNetUnfolderBase]: For 3742/3852 co-relation queries the response was YES. [2024-11-19 05:59:35,869 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-11-19 05:59:35,903 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2024-11-19 05:59:35,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2024-11-19 05:59:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-11-19 05:59:35,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-11-19 05:59:35,909 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2024-11-19 05:59:35,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2024-11-19 05:59:35,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:35,921 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2024-11-19 05:59:35,921 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-11-19 05:59:35,922 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2024-11-19 05:59:35,922 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2024-11-19 05:59:35,923 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-11-19 05:59:35,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:35,923 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-11-19 05:59:35,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:59:35,923 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-11-19 05:59:35,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash -621426886, now seen corresponding path program 1 times [2024-11-19 05:59:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:35,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737083514] [2024-11-19 05:59:35,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:36,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737083514] [2024-11-19 05:59:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737083514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:36,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132327836] [2024-11-19 05:59:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:36,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:36,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-19 05:59:36,661 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-11-19 05:59:36,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:36,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-19 05:59:36,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:38,600 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2024-11-19 05:59:38,600 INFO L125 PetriNetUnfolderBase]: For 4433/4543 co-relation queries the response was YES. [2024-11-19 05:59:38,655 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-11-19 05:59:38,689 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2024-11-19 05:59:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2024-11-19 05:59:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-11-19 05:59:38,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-11-19 05:59:38,696 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2024-11-19 05:59:38,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2024-11-19 05:59:38,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:38,715 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2024-11-19 05:59:38,716 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-11-19 05:59:38,716 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-11-19 05:59:38,717 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2024-11-19 05:59:38,717 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-11-19 05:59:38,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:38,718 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-11-19 05:59:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:59:38,718 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-11-19 05:59:38,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash -237480508, now seen corresponding path program 1 times [2024-11-19 05:59:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322316636] [2024-11-19 05:59:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322316636] [2024-11-19 05:59:38,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322316636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:38,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059367127] [2024-11-19 05:59:38,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:38,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:38,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:38,802 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-11-19 05:59:38,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:38,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:38,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:40,518 INFO L124 PetriNetUnfolderBase]: 884/10875 cut-off events. [2024-11-19 05:59:40,519 INFO L125 PetriNetUnfolderBase]: For 2300/2408 co-relation queries the response was YES. [2024-11-19 05:59:40,566 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-11-19 05:59:40,588 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-11-19 05:59:40,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2024-11-19 05:59:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-11-19 05:59:40,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-19 05:59:40,591 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2024-11-19 05:59:40,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2024-11-19 05:59:40,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:40,603 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2024-11-19 05:59:40,604 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-11-19 05:59:40,604 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2024-11-19 05:59:40,604 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2024-11-19 05:59:40,604 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-11-19 05:59:40,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:40,605 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-11-19 05:59:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:59:40,605 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-11-19 05:59:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1878527003, now seen corresponding path program 1 times [2024-11-19 05:59:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397336905] [2024-11-19 05:59:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:40,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:40,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397336905] [2024-11-19 05:59:40,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397336905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:40,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:40,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:40,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860336056] [2024-11-19 05:59:40,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:40,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:40,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:40,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:40,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:40,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-19 05:59:40,667 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-11-19 05:59:40,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:40,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-19 05:59:40,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:42,337 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-11-19 05:59:42,337 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-19 05:59:42,338 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 05:59:42,338 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-19 05:59:42,338 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 05:59:42,571 INFO L124 PetriNetUnfolderBase]: 997/11923 cut-off events. [2024-11-19 05:59:42,571 INFO L125 PetriNetUnfolderBase]: For 1884/1985 co-relation queries the response was YES. [2024-11-19 05:59:42,627 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-11-19 05:59:42,655 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2024-11-19 05:59:42,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2024-11-19 05:59:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-11-19 05:59:42,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-19 05:59:42,658 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2024-11-19 05:59:42,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2024-11-19 05:59:42,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:42,671 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2024-11-19 05:59:42,671 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-11-19 05:59:42,671 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2024-11-19 05:59:42,672 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2024-11-19 05:59:42,672 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-11-19 05:59:42,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:42,672 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-11-19 05:59:42,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:59:42,673 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-11-19 05:59:42,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1527746212, now seen corresponding path program 1 times [2024-11-19 05:59:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:42,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827678348] [2024-11-19 05:59:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827678348] [2024-11-19 05:59:43,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827678348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:43,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086182719] [2024-11-19 05:59:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:43,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:43,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:43,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 518 [2024-11-19 05:59:43,491 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-11-19 05:59:43,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:43,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 518 [2024-11-19 05:59:43,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:48,806 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-11-19 05:59:48,806 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-11-19 05:59:48,806 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-19 05:59:48,806 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-19 05:59:48,806 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-19 05:59:48,921 INFO L124 PetriNetUnfolderBase]: 6087/33187 cut-off events. [2024-11-19 05:59:48,922 INFO L125 PetriNetUnfolderBase]: For 11985/12100 co-relation queries the response was YES. [2024-11-19 05:59:49,097 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-11-19 05:59:49,189 INFO L140 encePairwiseOnDemand]: 503/518 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2024-11-19 05:59:49,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2024-11-19 05:59:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2024-11-19 05:59:49,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844916344916345 [2024-11-19 05:59:49,192 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2024-11-19 05:59:49,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2024-11-19 05:59:49,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:49,369 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2024-11-19 05:59:49,370 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-11-19 05:59:49,370 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-19 05:59:49,370 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2024-11-19 05:59:49,371 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-11-19 05:59:49,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:49,371 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-11-19 05:59:49,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:59:49,372 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-11-19 05:59:49,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1150734015, now seen corresponding path program 1 times [2024-11-19 05:59:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:49,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393781714] [2024-11-19 05:59:49,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:59:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393781714] [2024-11-19 05:59:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393781714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 05:59:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940735286] [2024-11-19 05:59:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:50,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 05:59:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:50,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 05:59:50,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-19 05:59:53,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-11-19 05:59:53,802 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-11-19 05:59:53,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:53,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-11-19 05:59:53,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:00,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_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-11-19 06:00:00,377 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-19 06:00:00,377 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 06:00:00,377 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-19 06:00:00,377 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-19 06:00:00,960 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_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-11-19 06:00:00,960 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-19 06:00:01,132 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 06:00:01,133 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-19 06:00:01,133 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-19 06:00:01,133 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-19 06:00:03,917 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-11-19 06:00:03,917 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-19 06:00:03,917 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-19 06:00:03,917 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-19 06:00:03,917 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-19 06:00:04,022 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-11-19 06:00:04,022 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-11-19 06:00:04,022 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-19 06:00:04,022 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-11-19 06:00:04,022 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-19 06:00:04,156 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-11-19 06:00:04,156 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-19 06:00:04,156 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-19 06:00:04,156 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-19 06:00:04,156 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-11-19 06:00:06,329 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-11-19 06:00:06,329 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2024-11-19 06:00:06,329 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:00:06,329 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:00:06,329 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:00:06,361 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-11-19 06:00:06,362 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2024-11-19 06:00:06,362 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-19 06:00:06,362 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-19 06:00:06,362 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-11-19 06:00:06,362 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-11-19 06:00:06,362 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-19 06:00:06,362 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-19 06:00:06,362 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:00:06,362 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:00:06,371 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-11-19 06:00:06,371 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-19 06:00:06,371 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:00:06,371 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:00:06,371 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:00:06,398 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-11-19 06:00:06,398 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2024-11-19 06:00:06,398 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:00:06,398 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-19 06:00:06,398 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:00:06,399 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-11-19 06:00:06,399 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-11-19 06:00:06,399 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-19 06:00:06,399 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-19 06:00:06,399 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-19 06:00:06,653 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2024-11-19 06:00:06,653 INFO L125 PetriNetUnfolderBase]: For 49248/54923 co-relation queries the response was YES. [2024-11-19 06:00:07,428 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-11-19 06:00:07,663 INFO L140 encePairwiseOnDemand]: 483/518 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2024-11-19 06:00:07,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2024-11-19 06:00:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 06:00:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-19 06:00:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2024-11-19 06:00:07,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.830719111969112 [2024-11-19 06:00:07,675 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2024-11-19 06:00:07,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2024-11-19 06:00:08,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:08,194 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2024-11-19 06:00:08,195 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-11-19 06:00:08,196 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2024-11-19 06:00:08,196 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2024-11-19 06:00:08,198 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-11-19 06:00:08,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:08,199 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-11-19 06:00:08,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:00:08,199 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-11-19 06:00:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash -528468227, now seen corresponding path program 2 times [2024-11-19 06:00:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828531761] [2024-11-19 06:00:08,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:00:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:08,235 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:00:08,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:00:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:00:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828531761] [2024-11-19 06:00:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828531761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 06:00:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795000772] [2024-11-19 06:00:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:09,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:00:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:00:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:00:12,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-11-19 06:00:12,997 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-11-19 06:00:12,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:12,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-11-19 06:00:12,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:15,562 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-11-19 06:00:15,562 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2024-11-19 06:00:15,562 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 06:00:15,562 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-11-19 06:00:15,562 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-19 06:00:16,337 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-11-19 06:00:16,337 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2024-11-19 06:00:16,337 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 06:00:16,337 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-19 06:00:16,337 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event