./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:46:32,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:46:32,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:46:32,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:46:32,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:46:32,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:46:32,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:46:32,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:46:32,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:46:32,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:46:32,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:46:32,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:46:32,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:46:32,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:46:32,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:46:32,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:46:32,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:46:32,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:46:32,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:46:32,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:46:32,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:46:32,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:46:32,795 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:46:32,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:46:32,797 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:46:32,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:46:32,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:46:32,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:46:32,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:46:32,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:46:32,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:46:32,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:32,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:46:32,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:46:32,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:46:32,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:46:32,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:46:32,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:46:32,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:46:32,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:46:32,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:46:32,802 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-16 23:46:33,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:46:33,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:46:33,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:46:33,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:46:33,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:46:33,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-16 23:46:34,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:46:34,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:46:34,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-16 23:46:34,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ec166a0/241a4884723d46d5929af1d2182c9620/FLAG464049215 [2024-11-16 23:46:34,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ec166a0/241a4884723d46d5929af1d2182c9620 [2024-11-16 23:46:34,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:46:34,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:46:34,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:34,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:46:34,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:46:34,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:34" (1/1) ... [2024-11-16 23:46:34,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c30fbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:34, skipping insertion in model container [2024-11-16 23:46:34,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:34" (1/1) ... [2024-11-16 23:46:34,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:46:34,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:35,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:46:35,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:35,093 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:46:35,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35 WrapperNode [2024-11-16 23:46:35,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:35,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:35,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:46:35,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:46:35,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,153 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 273 [2024-11-16 23:46:35,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:35,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:46:35,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:46:35,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:46:35,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:46:35,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:46:35,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:46:35,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:46:35,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (1/1) ... [2024-11-16 23:46:35,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:35,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:46:35,273 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-16 23:46:35,292 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-16 23:46:35,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:46:35,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:46:35,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:46:35,341 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:46:35,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:46:35,341 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:46:35,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:46:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:46:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:46:35,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:46:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:46:35,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:46:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:46:35,360 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:46:35,467 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:46:35,470 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:46:36,161 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:46:36,161 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:46:36,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:46:36,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:46:36,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:36 BoogieIcfgContainer [2024-11-16 23:46:36,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:46:36,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:46:36,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:46:36,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:46:36,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:46:34" (1/3) ... [2024-11-16 23:46:36,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e9c769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:36, skipping insertion in model container [2024-11-16 23:46:36,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:35" (2/3) ... [2024-11-16 23:46:36,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e9c769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:36, skipping insertion in model container [2024-11-16 23:46:36,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:36" (3/3) ... [2024-11-16 23:46:36,215 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-16 23:46:36,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:46:36,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-16 23:46:36,231 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:46:36,377 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:46:36,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 497 places, 514 transitions, 1049 flow [2024-11-16 23:46:36,605 INFO L124 PetriNetUnfolderBase]: 27/511 cut-off events. [2024-11-16 23:46:36,606 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:46:36,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 511 events. 27/511 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 768 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 400. Up to 2 conditions per place. [2024-11-16 23:46:36,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 497 places, 514 transitions, 1049 flow [2024-11-16 23:46:36,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 492 transitions, 1002 flow [2024-11-16 23:46:36,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:46:36,644 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;@6952b7d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:46:36,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-16 23:46:36,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:46:36,650 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-16 23:46:36,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:46:36,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:36,651 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] [2024-11-16 23:46:36,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1904746233, now seen corresponding path program 1 times [2024-11-16 23:46:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900231181] [2024-11-16 23:46:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:36,937 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-16 23:46:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:36,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900231181] [2024-11-16 23:46:36,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900231181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:36,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:36,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640833061] [2024-11-16 23:46:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:36,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:37,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 514 [2024-11-16 23:46:37,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 492 transitions, 1002 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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-16 23:46:37,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:37,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 514 [2024-11-16 23:46:37,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:37,308 INFO L124 PetriNetUnfolderBase]: 23/767 cut-off events. [2024-11-16 23:46:37,309 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-16 23:46:37,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 767 events. 23/767 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2663 event pairs, 7 based on Foata normal form. 26/677 useless extension candidates. Maximal degree in co-relation 423. Up to 31 conditions per place. [2024-11-16 23:46:37,323 INFO L140 encePairwiseOnDemand]: 494/514 looper letters, 13 selfloop transitions, 2 changer transitions 10/474 dead transitions. [2024-11-16 23:46:37,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 474 transitions, 996 flow [2024-11-16 23:46:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1467 transitions. [2024-11-16 23:46:37,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513618677042801 [2024-11-16 23:46:37,352 INFO L175 Difference]: Start difference. First operand has 476 places, 492 transitions, 1002 flow. Second operand 3 states and 1467 transitions. [2024-11-16 23:46:37,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 474 transitions, 996 flow [2024-11-16 23:46:37,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 474 transitions, 984 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:46:37,373 INFO L231 Difference]: Finished difference. Result has 471 places, 464 transitions, 938 flow [2024-11-16 23:46:37,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=471, PETRI_TRANSITIONS=464} [2024-11-16 23:46:37,383 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2024-11-16 23:46:37,383 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 464 transitions, 938 flow [2024-11-16 23:46:37,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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-16 23:46:37,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:37,385 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] [2024-11-16 23:46:37,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:46:37,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1226579234, now seen corresponding path program 1 times [2024-11-16 23:46:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:37,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231488821] [2024-11-16 23:46:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:37,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:37,459 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-16 23:46:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231488821] [2024-11-16 23:46:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231488821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044371784] [2024-11-16 23:46:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:37,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 514 [2024-11-16 23:46:37,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 464 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-16 23:46:37,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:37,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 514 [2024-11-16 23:46:37,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:37,682 INFO L124 PetriNetUnfolderBase]: 17/608 cut-off events. [2024-11-16 23:46:37,685 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:46:37,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 608 events. 17/608 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1655 event pairs, 5 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 619. Up to 31 conditions per place. [2024-11-16 23:46:37,695 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 17 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2024-11-16 23:46:37,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 463 transitions, 974 flow [2024-11-16 23:46:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1442 transitions. [2024-11-16 23:46:37,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351491569390402 [2024-11-16 23:46:37,701 INFO L175 Difference]: Start difference. First operand has 471 places, 464 transitions, 938 flow. Second operand 3 states and 1442 transitions. [2024-11-16 23:46:37,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 463 transitions, 974 flow [2024-11-16 23:46:37,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 463 transitions, 970 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:37,721 INFO L231 Difference]: Finished difference. Result has 460 places, 463 transitions, 936 flow [2024-11-16 23:46:37,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=460, PETRI_TRANSITIONS=463} [2024-11-16 23:46:37,723 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -16 predicate places. [2024-11-16 23:46:37,727 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 463 transitions, 936 flow [2024-11-16 23:46:37,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-16 23:46:37,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:37,729 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] [2024-11-16 23:46:37,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:46:37,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:37,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 191269511, now seen corresponding path program 1 times [2024-11-16 23:46:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436149125] [2024-11-16 23:46:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:37,844 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-16 23:46:37,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436149125] [2024-11-16 23:46:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436149125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:37,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:37,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:37,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440115241] [2024-11-16 23:46:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:37,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:37,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:37,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:37,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 514 [2024-11-16 23:46:37,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 463 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 465.0) internal successors, (1395), 3 states have internal predecessors, (1395), 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-16 23:46:37,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:37,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 514 [2024-11-16 23:46:37,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:38,030 INFO L124 PetriNetUnfolderBase]: 29/739 cut-off events. [2024-11-16 23:46:38,030 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-16 23:46:38,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 739 events. 29/739 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2657 event pairs, 12 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 767. Up to 54 conditions per place. [2024-11-16 23:46:38,040 INFO L140 encePairwiseOnDemand]: 505/514 looper letters, 22 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2024-11-16 23:46:38,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 455 transitions, 966 flow [2024-11-16 23:46:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1423 transitions. [2024-11-16 23:46:38,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228274967574579 [2024-11-16 23:46:38,045 INFO L175 Difference]: Start difference. First operand has 460 places, 463 transitions, 936 flow. Second operand 3 states and 1423 transitions. [2024-11-16 23:46:38,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 455 transitions, 966 flow [2024-11-16 23:46:38,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 455 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:38,053 INFO L231 Difference]: Finished difference. Result has 452 places, 455 transitions, 918 flow [2024-11-16 23:46:38,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=452, PETRI_TRANSITIONS=455} [2024-11-16 23:46:38,055 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -24 predicate places. [2024-11-16 23:46:38,056 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 455 transitions, 918 flow [2024-11-16 23:46:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.0) internal successors, (1395), 3 states have internal predecessors, (1395), 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-16 23:46:38,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:38,058 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] [2024-11-16 23:46:38,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:46:38,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:38,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1840782379, now seen corresponding path program 1 times [2024-11-16 23:46:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424096440] [2024-11-16 23:46:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:38,701 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-16 23:46:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424096440] [2024-11-16 23:46:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424096440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:38,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679955789] [2024-11-16 23:46:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:38,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:39,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 514 [2024-11-16 23:46:39,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 455 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 390.5) internal successors, (2343), 6 states have internal predecessors, (2343), 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-16 23:46:39,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:39,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 514 [2024-11-16 23:46:39,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:42,678 INFO L124 PetriNetUnfolderBase]: 5286/18352 cut-off events. [2024-11-16 23:46:42,678 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-16 23:46:42,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26433 conditions, 18352 events. 5286/18352 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 206874 event pairs, 4536 based on Foata normal form. 0/15644 useless extension candidates. Maximal degree in co-relation 26395. Up to 7875 conditions per place. [2024-11-16 23:46:42,849 INFO L140 encePairwiseOnDemand]: 490/514 looper letters, 82 selfloop transitions, 20 changer transitions 0/451 dead transitions. [2024-11-16 23:46:42,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 451 transitions, 1114 flow [2024-11-16 23:46:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2440 transitions. [2024-11-16 23:46:42,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7911802853437094 [2024-11-16 23:46:42,855 INFO L175 Difference]: Start difference. First operand has 452 places, 455 transitions, 918 flow. Second operand 6 states and 2440 transitions. [2024-11-16 23:46:42,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 451 transitions, 1114 flow [2024-11-16 23:46:42,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 451 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:42,867 INFO L231 Difference]: Finished difference. Result has 452 places, 451 transitions, 949 flow [2024-11-16 23:46:42,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=452, PETRI_TRANSITIONS=451} [2024-11-16 23:46:42,869 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -24 predicate places. [2024-11-16 23:46:42,870 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 451 transitions, 949 flow [2024-11-16 23:46:42,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 390.5) internal successors, (2343), 6 states have internal predecessors, (2343), 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-16 23:46:42,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:42,872 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] [2024-11-16 23:46:42,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:46:42,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:42,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1152446354, now seen corresponding path program 1 times [2024-11-16 23:46:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605590788] [2024-11-16 23:46:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:42,910 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-16 23:46:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605590788] [2024-11-16 23:46:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605590788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959588236] [2024-11-16 23:46:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:42,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 514 [2024-11-16 23:46:42,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 451 transitions, 949 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-16 23:46:42,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:42,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 514 [2024-11-16 23:46:42,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,135 INFO L124 PetriNetUnfolderBase]: 28/678 cut-off events. [2024-11-16 23:46:43,136 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:46:43,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 678 events. 28/678 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2268 event pairs, 15 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 711. Up to 40 conditions per place. [2024-11-16 23:46:43,142 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 12 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2024-11-16 23:46:43,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 450 transitions, 975 flow [2024-11-16 23:46:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1452 transitions. [2024-11-16 23:46:43,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9416342412451362 [2024-11-16 23:46:43,146 INFO L175 Difference]: Start difference. First operand has 452 places, 451 transitions, 949 flow. Second operand 3 states and 1452 transitions. [2024-11-16 23:46:43,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 450 transitions, 975 flow [2024-11-16 23:46:43,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 450 transitions, 935 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:43,154 INFO L231 Difference]: Finished difference. Result has 448 places, 450 transitions, 911 flow [2024-11-16 23:46:43,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=446, 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=911, PETRI_PLACES=448, PETRI_TRANSITIONS=450} [2024-11-16 23:46:43,157 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -28 predicate places. [2024-11-16 23:46:43,157 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 450 transitions, 911 flow [2024-11-16 23:46:43,159 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-16 23:46:43,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:43,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:46:43,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:43,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1228724937, now seen corresponding path program 1 times [2024-11-16 23:46:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11162596] [2024-11-16 23:46:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,221 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-16 23:46:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11162596] [2024-11-16 23:46:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11162596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281042730] [2024-11-16 23:46:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:43,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 514 [2024-11-16 23:46:43,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 450 transitions, 911 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-16 23:46:43,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:43,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 514 [2024-11-16 23:46:43,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,330 INFO L124 PetriNetUnfolderBase]: 28/677 cut-off events. [2024-11-16 23:46:43,331 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:46:43,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 677 events. 28/677 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2226 event pairs, 15 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 692. Up to 40 conditions per place. [2024-11-16 23:46:43,337 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 12 selfloop transitions, 2 changer transitions 0/449 dead transitions. [2024-11-16 23:46:43,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 449 transitions, 937 flow [2024-11-16 23:46:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1452 transitions. [2024-11-16 23:46:43,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9416342412451362 [2024-11-16 23:46:43,341 INFO L175 Difference]: Start difference. First operand has 448 places, 450 transitions, 911 flow. Second operand 3 states and 1452 transitions. [2024-11-16 23:46:43,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 449 transitions, 937 flow [2024-11-16 23:46:43,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 449 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:43,350 INFO L231 Difference]: Finished difference. Result has 447 places, 449 transitions, 909 flow [2024-11-16 23:46:43,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=909, PETRI_PLACES=447, PETRI_TRANSITIONS=449} [2024-11-16 23:46:43,352 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -29 predicate places. [2024-11-16 23:46:43,353 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 449 transitions, 909 flow [2024-11-16 23:46:43,355 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-16 23:46:43,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,355 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] [2024-11-16 23:46:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:46:43,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:43,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1444044745, now seen corresponding path program 1 times [2024-11-16 23:46:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265712527] [2024-11-16 23:46:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,432 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-16 23:46:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265712527] [2024-11-16 23:46:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265712527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:43,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752778394] [2024-11-16 23:46:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:43,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 514 [2024-11-16 23:46:43,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 449 transitions, 909 flow. Second operand has 3 states, 3 states have (on average 481.3333333333333) internal successors, (1444), 3 states have internal predecessors, (1444), 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-16 23:46:43,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:43,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 514 [2024-11-16 23:46:43,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,519 INFO L124 PetriNetUnfolderBase]: 13/555 cut-off events. [2024-11-16 23:46:43,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:46:43,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 555 events. 13/555 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1309 event pairs, 2 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 544. Up to 16 conditions per place. [2024-11-16 23:46:43,525 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2024-11-16 23:46:43,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 448 transitions, 933 flow [2024-11-16 23:46:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1454 transitions. [2024-11-16 23:46:43,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9429312581063554 [2024-11-16 23:46:43,529 INFO L175 Difference]: Start difference. First operand has 447 places, 449 transitions, 909 flow. Second operand 3 states and 1454 transitions. [2024-11-16 23:46:43,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 448 transitions, 933 flow [2024-11-16 23:46:43,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 448 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:43,537 INFO L231 Difference]: Finished difference. Result has 446 places, 448 transitions, 907 flow [2024-11-16 23:46:43,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=446, PETRI_TRANSITIONS=448} [2024-11-16 23:46:43,539 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -30 predicate places. [2024-11-16 23:46:43,540 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 448 transitions, 907 flow [2024-11-16 23:46:43,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 481.3333333333333) internal successors, (1444), 3 states have internal predecessors, (1444), 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-16 23:46:43,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,541 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] [2024-11-16 23:46:43,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:46:43,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:43,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1268589838, now seen corresponding path program 1 times [2024-11-16 23:46:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816686616] [2024-11-16 23:46:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,600 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-16 23:46:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816686616] [2024-11-16 23:46:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816686616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:43,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723191152] [2024-11-16 23:46:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:43,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:43,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 514 [2024-11-16 23:46:43,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 448 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-16 23:46:43,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:43,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 514 [2024-11-16 23:46:43,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,691 INFO L124 PetriNetUnfolderBase]: 17/510 cut-off events. [2024-11-16 23:46:43,691 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:46:43,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 510 events. 17/510 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1060 event pairs, 7 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 508. Up to 26 conditions per place. [2024-11-16 23:46:43,696 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 12 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2024-11-16 23:46:43,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 447 transitions, 933 flow [2024-11-16 23:46:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1452 transitions. [2024-11-16 23:46:43,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9416342412451362 [2024-11-16 23:46:43,700 INFO L175 Difference]: Start difference. First operand has 446 places, 448 transitions, 907 flow. Second operand 3 states and 1452 transitions. [2024-11-16 23:46:43,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 447 transitions, 933 flow [2024-11-16 23:46:43,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 447 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:43,707 INFO L231 Difference]: Finished difference. Result has 445 places, 447 transitions, 905 flow [2024-11-16 23:46:43,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=445, PETRI_TRANSITIONS=447} [2024-11-16 23:46:43,709 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -31 predicate places. [2024-11-16 23:46:43,709 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 447 transitions, 905 flow [2024-11-16 23:46:43,710 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-16 23:46:43,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,711 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-16 23:46:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:46:43,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1045992388, now seen corresponding path program 1 times [2024-11-16 23:46:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575560405] [2024-11-16 23:46:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,764 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-16 23:46:43,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575560405] [2024-11-16 23:46:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575560405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558692853] [2024-11-16 23:46:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:43,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 514 [2024-11-16 23:46:43,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 447 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 477.0) internal successors, (1431), 3 states have internal predecessors, (1431), 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-16 23:46:43,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:43,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 514 [2024-11-16 23:46:43,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,947 INFO L124 PetriNetUnfolderBase]: 41/881 cut-off events. [2024-11-16 23:46:43,947 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-16 23:46:43,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 881 events. 41/881 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3829 event pairs, 20 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 910. Up to 56 conditions per place. [2024-11-16 23:46:43,955 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 14 selfloop transitions, 1 changer transitions 0/443 dead transitions. [2024-11-16 23:46:43,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 443 transitions, 927 flow [2024-11-16 23:46:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1447 transitions. [2024-11-16 23:46:43,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9383916990920882 [2024-11-16 23:46:43,959 INFO L175 Difference]: Start difference. First operand has 445 places, 447 transitions, 905 flow. Second operand 3 states and 1447 transitions. [2024-11-16 23:46:43,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 443 transitions, 927 flow [2024-11-16 23:46:43,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 443 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:43,967 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 895 flow [2024-11-16 23:46:43,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2024-11-16 23:46:43,968 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -35 predicate places. [2024-11-16 23:46:43,969 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 895 flow [2024-11-16 23:46:43,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.0) internal successors, (1431), 3 states have internal predecessors, (1431), 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-16 23:46:43,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,970 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] [2024-11-16 23:46:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:46:43,970 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -210019709, now seen corresponding path program 1 times [2024-11-16 23:46:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477121138] [2024-11-16 23:46:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477121138] [2024-11-16 23:46:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477121138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:44,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:44,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389585530] [2024-11-16 23:46:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:44,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2024-11-16 23:46:44,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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-16 23:46:44,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:44,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2024-11-16 23:46:44,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,118 INFO L124 PetriNetUnfolderBase]: 17/562 cut-off events. [2024-11-16 23:46:44,118 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:46:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 562 events. 17/562 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1283 event pairs, 0 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 562. Up to 19 conditions per place. [2024-11-16 23:46:44,123 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 16 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2024-11-16 23:46:44,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 448 transitions, 946 flow [2024-11-16 23:46:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1466 transitions. [2024-11-16 23:46:44,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9507133592736705 [2024-11-16 23:46:44,127 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 895 flow. Second operand 3 states and 1466 transitions. [2024-11-16 23:46:44,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 448 transitions, 946 flow [2024-11-16 23:46:44,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 448 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:44,137 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 904 flow [2024-11-16 23:46:44,138 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2024-11-16 23:46:44,139 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -35 predicate places. [2024-11-16 23:46:44,139 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 904 flow [2024-11-16 23:46:44,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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-16 23:46:44,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:44,141 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] [2024-11-16 23:46:44,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:46:44,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 34554916, now seen corresponding path program 1 times [2024-11-16 23:46:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865027611] [2024-11-16 23:46:44,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:44,210 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-16 23:46:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:44,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865027611] [2024-11-16 23:46:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865027611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853510069] [2024-11-16 23:46:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:44,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:44,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:44,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:44,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:44,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 514 [2024-11-16 23:46:44,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 904 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-16 23:46:44,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:44,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 514 [2024-11-16 23:46:44,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,489 INFO L124 PetriNetUnfolderBase]: 135/1968 cut-off events. [2024-11-16 23:46:44,489 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2024-11-16 23:46:44,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 1968 events. 135/1968 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13305 event pairs, 36 based on Foata normal form. 0/1724 useless extension candidates. Maximal degree in co-relation 2154. Up to 187 conditions per place. [2024-11-16 23:46:44,508 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 18 selfloop transitions, 3 changer transitions 0/448 dead transitions. [2024-11-16 23:46:44,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 448 transitions, 961 flow [2024-11-16 23:46:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1461 transitions. [2024-11-16 23:46:44,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9474708171206225 [2024-11-16 23:46:44,512 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 904 flow. Second operand 3 states and 1461 transitions. [2024-11-16 23:46:44,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 448 transitions, 961 flow [2024-11-16 23:46:44,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 448 transitions, 961 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:44,521 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 919 flow [2024-11-16 23:46:44,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2024-11-16 23:46:44,524 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -35 predicate places. [2024-11-16 23:46:44,524 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 919 flow [2024-11-16 23:46:44,525 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-16 23:46:44,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:44,525 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] [2024-11-16 23:46:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:46:44,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:44,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1256500876, now seen corresponding path program 1 times [2024-11-16 23:46:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303712691] [2024-11-16 23:46:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:44,594 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-16 23:46:44,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:44,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303712691] [2024-11-16 23:46:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303712691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260584347] [2024-11-16 23:46:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:44,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:44,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 514 [2024-11-16 23:46:44,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 919 flow. Second operand has 3 states, 3 states have (on average 480.6666666666667) internal successors, (1442), 3 states have internal predecessors, (1442), 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-16 23:46:44,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:44,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 514 [2024-11-16 23:46:44,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,922 INFO L124 PetriNetUnfolderBase]: 148/1737 cut-off events. [2024-11-16 23:46:44,922 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2024-11-16 23:46:44,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 1737 events. 148/1737 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10904 event pairs, 22 based on Foata normal form. 0/1557 useless extension candidates. Maximal degree in co-relation 1979. Up to 169 conditions per place. [2024-11-16 23:46:44,942 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 17 selfloop transitions, 3 changer transitions 0/447 dead transitions. [2024-11-16 23:46:44,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 447 transitions, 971 flow [2024-11-16 23:46:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-11-16 23:46:44,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2024-11-16 23:46:44,947 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 919 flow. Second operand 3 states and 1460 transitions. [2024-11-16 23:46:44,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 447 transitions, 971 flow [2024-11-16 23:46:44,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 447 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:44,957 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 934 flow [2024-11-16 23:46:44,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2024-11-16 23:46:44,959 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -35 predicate places. [2024-11-16 23:46:44,960 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 934 flow [2024-11-16 23:46:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.6666666666667) internal successors, (1442), 3 states have internal predecessors, (1442), 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-16 23:46:44,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:46:44,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:46:44,962 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:44,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1896148633, now seen corresponding path program 1 times [2024-11-16 23:46:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755084813] [2024-11-16 23:46:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:45,236 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-16 23:46:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755084813] [2024-11-16 23:46:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755084813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 23:46:45,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962503926] [2024-11-16 23:46:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:45,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 23:46:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 23:46:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:46:45,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 514 [2024-11-16 23:46:45,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 934 flow. Second operand has 7 states, 7 states have (on average 452.2857142857143) internal successors, (3166), 7 states have internal predecessors, (3166), 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-16 23:46:45,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:45,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 514 [2024-11-16 23:46:45,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,076 INFO L124 PetriNetUnfolderBase]: 87/1607 cut-off events. [2024-11-16 23:46:46,077 INFO L125 PetriNetUnfolderBase]: For 11/34 co-relation queries the response was YES. [2024-11-16 23:46:46,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 1607 events. 87/1607 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7141 event pairs, 20 based on Foata normal form. 5/1509 useless extension candidates. Maximal degree in co-relation 1887. Up to 76 conditions per place. [2024-11-16 23:46:46,093 INFO L140 encePairwiseOnDemand]: 477/514 looper letters, 49 selfloop transitions, 56 changer transitions 0/500 dead transitions. [2024-11-16 23:46:46,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 500 transitions, 1266 flow [2024-11-16 23:46:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:46:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:46:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4576 transitions. [2024-11-16 23:46:46,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.890272373540856 [2024-11-16 23:46:46,105 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 934 flow. Second operand 10 states and 4576 transitions. [2024-11-16 23:46:46,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 500 transitions, 1266 flow [2024-11-16 23:46:46,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 500 transitions, 1266 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:46,116 INFO L231 Difference]: Finished difference. Result has 454 places, 477 transitions, 1189 flow [2024-11-16 23:46:46,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1189, PETRI_PLACES=454, PETRI_TRANSITIONS=477} [2024-11-16 23:46:46,118 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -22 predicate places. [2024-11-16 23:46:46,119 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 477 transitions, 1189 flow [2024-11-16 23:46:46,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 452.2857142857143) internal successors, (3166), 7 states have internal predecessors, (3166), 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-16 23:46:46,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:46,122 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] [2024-11-16 23:46:46,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:46:46,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:46,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1387831128, now seen corresponding path program 1 times [2024-11-16 23:46:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361997101] [2024-11-16 23:46:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:46,318 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-16 23:46:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361997101] [2024-11-16 23:46:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361997101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975779861] [2024-11-16 23:46:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:46:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:46:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:46:46,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 514 [2024-11-16 23:46:46,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 477 transitions, 1189 flow. Second operand has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 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-16 23:46:46,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:46,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 514 [2024-11-16 23:46:46,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,980 INFO L124 PetriNetUnfolderBase]: 158/2610 cut-off events. [2024-11-16 23:46:46,981 INFO L125 PetriNetUnfolderBase]: For 78/126 co-relation queries the response was YES. [2024-11-16 23:46:47,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 2610 events. 158/2610 cut-off events. For 78/126 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16042 event pairs, 39 based on Foata normal form. 10/2425 useless extension candidates. Maximal degree in co-relation 3133. Up to 121 conditions per place. [2024-11-16 23:46:47,019 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 24 selfloop transitions, 5 changer transitions 0/488 dead transitions. [2024-11-16 23:46:47,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 488 transitions, 1277 flow [2024-11-16 23:46:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:46:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 23:46:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2410 transitions. [2024-11-16 23:46:47,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377431906614786 [2024-11-16 23:46:47,026 INFO L175 Difference]: Start difference. First operand has 454 places, 477 transitions, 1189 flow. Second operand 5 states and 2410 transitions. [2024-11-16 23:46:47,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 488 transitions, 1277 flow [2024-11-16 23:46:47,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 488 transitions, 1277 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:47,040 INFO L231 Difference]: Finished difference. Result has 460 places, 479 transitions, 1214 flow [2024-11-16 23:46:47,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1214, PETRI_PLACES=460, PETRI_TRANSITIONS=479} [2024-11-16 23:46:47,042 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -16 predicate places. [2024-11-16 23:46:47,043 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 479 transitions, 1214 flow [2024-11-16 23:46:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 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-16 23:46:47,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:47,045 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] [2024-11-16 23:46:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:46:47,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -409080803, now seen corresponding path program 1 times [2024-11-16 23:46:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126812120] [2024-11-16 23:46:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:47,827 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-16 23:46:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126812120] [2024-11-16 23:46:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126812120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329891228] [2024-11-16 23:46:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:48,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 514 [2024-11-16 23:46:48,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 479 transitions, 1214 flow. Second operand has 6 states, 6 states have (on average 451.6666666666667) internal successors, (2710), 6 states have internal predecessors, (2710), 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-16 23:46:48,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:48,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 514 [2024-11-16 23:46:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:50,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L67-25-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][370], [570#true, 248#L51-24true, 529#(= |#race~M~0| 0), 540#(= |#race~C2~0| 0), 467#L67-24true, 508#(= |#race~N~0| 0), 542#true, Black: 552#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, Black: 547#(<= ~N~0 0), 136#L62true, 536#(= |#race~A~0| 0), Black: 554#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 548#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 530#true, Black: 567#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 534#true, Black: 566#(<= (+ ~M~0 1) 0), 532#(= |#race~C1~0| 0), Black: 538#true, 563#true]) [2024-11-16 23:46:50,569 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-16 23:46:50,569 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:46:50,569 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:46:50,569 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-16 23:46:50,962 INFO L124 PetriNetUnfolderBase]: 2249/13808 cut-off events. [2024-11-16 23:46:50,962 INFO L125 PetriNetUnfolderBase]: For 877/913 co-relation queries the response was YES. [2024-11-16 23:46:51,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18882 conditions, 13808 events. 2249/13808 cut-off events. For 877/913 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 150927 event pairs, 1160 based on Foata normal form. 0/12406 useless extension candidates. Maximal degree in co-relation 18830. Up to 3033 conditions per place. [2024-11-16 23:46:51,125 INFO L140 encePairwiseOnDemand]: 499/514 looper letters, 54 selfloop transitions, 38 changer transitions 0/524 dead transitions. [2024-11-16 23:46:51,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 524 transitions, 1496 flow [2024-11-16 23:46:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2791 transitions. [2024-11-16 23:46:51,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9049935149156939 [2024-11-16 23:46:51,131 INFO L175 Difference]: Start difference. First operand has 460 places, 479 transitions, 1214 flow. Second operand 6 states and 2791 transitions. [2024-11-16 23:46:51,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 524 transitions, 1496 flow [2024-11-16 23:46:51,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 524 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:51,151 INFO L231 Difference]: Finished difference. Result has 468 places, 516 transitions, 1463 flow [2024-11-16 23:46:51,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1463, PETRI_PLACES=468, PETRI_TRANSITIONS=516} [2024-11-16 23:46:51,154 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -8 predicate places. [2024-11-16 23:46:51,154 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 516 transitions, 1463 flow [2024-11-16 23:46:51,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 451.6666666666667) internal successors, (2710), 6 states have internal predecessors, (2710), 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-16 23:46:51,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:51,155 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] [2024-11-16 23:46:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:46:51,156 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2010373758, now seen corresponding path program 1 times [2024-11-16 23:46:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213980970] [2024-11-16 23:46:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:51,220 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-16 23:46:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213980970] [2024-11-16 23:46:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213980970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680595812] [2024-11-16 23:46:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:51,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:51,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 514 [2024-11-16 23:46:51,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 516 transitions, 1463 flow. Second operand has 3 states, 3 states have (on average 480.6666666666667) internal successors, (1442), 3 states have internal predecessors, (1442), 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-16 23:46:51,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:51,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 514 [2024-11-16 23:46:51,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:52,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L67-25-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][362], [Black: 572#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 574#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 583#(= |#race~B~0| 0), Black: 575#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 573#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 467#L67-24true, Black: 530#true, Black: 534#true, Black: 538#true, 570#true, 248#L51-24true, 529#(= |#race~M~0| 0), 540#(= |#race~C2~0| 0), 508#(= |#race~N~0| 0), 542#true, Black: 552#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, 536#(= |#race~A~0| 0), Black: 547#(<= ~N~0 0), Black: 554#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 548#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 567#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 566#(<= (+ ~M~0 1) 0), 532#(= |#race~C1~0| 0), 307#L59-26true]) [2024-11-16 23:46:52,835 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-16 23:46:52,835 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:46:52,835 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:46:52,835 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-16 23:46:53,150 INFO L124 PetriNetUnfolderBase]: 1600/11590 cut-off events. [2024-11-16 23:46:53,150 INFO L125 PetriNetUnfolderBase]: For 745/962 co-relation queries the response was YES. [2024-11-16 23:46:53,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 11590 events. 1600/11590 cut-off events. For 745/962 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 122438 event pairs, 343 based on Foata normal form. 0/10664 useless extension candidates. Maximal degree in co-relation 16476. Up to 1365 conditions per place. [2024-11-16 23:46:53,238 INFO L140 encePairwiseOnDemand]: 508/514 looper letters, 18 selfloop transitions, 3 changer transitions 0/521 dead transitions. [2024-11-16 23:46:53,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 521 transitions, 1520 flow [2024-11-16 23:46:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1461 transitions. [2024-11-16 23:46:53,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9474708171206225 [2024-11-16 23:46:53,241 INFO L175 Difference]: Start difference. First operand has 468 places, 516 transitions, 1463 flow. Second operand 3 states and 1461 transitions. [2024-11-16 23:46:53,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 521 transitions, 1520 flow [2024-11-16 23:46:53,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 521 transitions, 1520 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:53,257 INFO L231 Difference]: Finished difference. Result has 468 places, 516 transitions, 1478 flow [2024-11-16 23:46:53,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=468, PETRI_TRANSITIONS=516} [2024-11-16 23:46:53,258 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, -8 predicate places. [2024-11-16 23:46:53,259 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 516 transitions, 1478 flow [2024-11-16 23:46:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.6666666666667) internal successors, (1442), 3 states have internal predecessors, (1442), 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-16 23:46:53,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:53,260 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] [2024-11-16 23:46:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:46:53,260 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:53,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1660987312, now seen corresponding path program 1 times [2024-11-16 23:46:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734872130] [2024-11-16 23:46:53,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:53,767 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-16 23:46:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734872130] [2024-11-16 23:46:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734872130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:53,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:53,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470661686] [2024-11-16 23:46:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:53,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:54,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 514 [2024-11-16 23:46:54,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 516 transitions, 1478 flow. Second operand has 6 states, 6 states have (on average 451.8333333333333) internal successors, (2711), 6 states have internal predecessors, (2711), 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-16 23:46:54,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:54,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 514 [2024-11-16 23:46:54,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:57,827 INFO L124 PetriNetUnfolderBase]: 4627/22177 cut-off events. [2024-11-16 23:46:57,828 INFO L125 PetriNetUnfolderBase]: For 5363/7745 co-relation queries the response was YES. [2024-11-16 23:46:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36875 conditions, 22177 events. 4627/22177 cut-off events. For 5363/7745 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 266977 event pairs, 1255 based on Foata normal form. 57/20431 useless extension candidates. Maximal degree in co-relation 36818. Up to 5415 conditions per place. [2024-11-16 23:46:58,213 INFO L140 encePairwiseOnDemand]: 499/514 looper letters, 85 selfloop transitions, 110 changer transitions 0/633 dead transitions. [2024-11-16 23:46:58,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 633 transitions, 2440 flow [2024-11-16 23:46:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2791 transitions. [2024-11-16 23:46:58,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9049935149156939 [2024-11-16 23:46:58,223 INFO L175 Difference]: Start difference. First operand has 468 places, 516 transitions, 1478 flow. Second operand 6 states and 2791 transitions. [2024-11-16 23:46:58,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 633 transitions, 2440 flow [2024-11-16 23:46:58,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 633 transitions, 2440 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:58,258 INFO L231 Difference]: Finished difference. Result has 478 places, 625 transitions, 2536 flow [2024-11-16 23:46:58,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2536, PETRI_PLACES=478, PETRI_TRANSITIONS=625} [2024-11-16 23:46:58,260 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, 2 predicate places. [2024-11-16 23:46:58,260 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 625 transitions, 2536 flow [2024-11-16 23:46:58,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 451.8333333333333) internal successors, (2711), 6 states have internal predecessors, (2711), 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-16 23:46:58,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:46:58,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:46:58,264 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:46:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash 547005953, now seen corresponding path program 1 times [2024-11-16 23:46:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42375054] [2024-11-16 23:46:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:59,076 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-16 23:46:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42375054] [2024-11-16 23:46:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42375054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574972980] [2024-11-16 23:46:59,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:59,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:59,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 514 [2024-11-16 23:46:59,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 625 transitions, 2536 flow. Second operand has 6 states, 6 states have (on average 451.6666666666667) internal successors, (2710), 6 states have internal predecessors, (2710), 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-16 23:46:59,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:59,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 514 [2024-11-16 23:46:59,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:05,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L67-25-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][361], [Black: 572#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 574#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 583#(= |#race~B~0| 0), Black: 575#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 573#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 581#true, 467#L67-24true, Black: 588#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 587#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 590#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 589#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 530#true, 585#true, Black: 534#true, Black: 538#true, 596#true, 570#true, 248#L51-24true, 529#(= |#race~M~0| 0), 540#(= |#race~C2~0| 0), 508#(= |#race~N~0| 0), 542#true, 150#L89-1true, Black: 552#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 136#L62true, 536#(= |#race~A~0| 0), Black: 547#(<= ~N~0 0), Black: 554#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 548#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 567#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 566#(<= (+ ~M~0 1) 0), 532#(= |#race~C1~0| 0)]) [2024-11-16 23:47:05,243 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-16 23:47:05,243 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:47:05,243 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:47:05,243 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-16 23:47:06,105 INFO L124 PetriNetUnfolderBase]: 6954/31129 cut-off events. [2024-11-16 23:47:06,105 INFO L125 PetriNetUnfolderBase]: For 22408/31196 co-relation queries the response was YES. [2024-11-16 23:47:06,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61300 conditions, 31129 events. 6954/31129 cut-off events. For 22408/31196 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 393887 event pairs, 1661 based on Foata normal form. 203/29029 useless extension candidates. Maximal degree in co-relation 61238. Up to 7756 conditions per place. [2024-11-16 23:47:06,484 INFO L140 encePairwiseOnDemand]: 499/514 looper letters, 187 selfloop transitions, 215 changer transitions 0/842 dead transitions. [2024-11-16 23:47:06,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 842 transitions, 5034 flow [2024-11-16 23:47:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2791 transitions. [2024-11-16 23:47:06,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9049935149156939 [2024-11-16 23:47:06,491 INFO L175 Difference]: Start difference. First operand has 478 places, 625 transitions, 2536 flow. Second operand 6 states and 2791 transitions. [2024-11-16 23:47:06,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 842 transitions, 5034 flow [2024-11-16 23:47:06,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 842 transitions, 5034 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:47:06,562 INFO L231 Difference]: Finished difference. Result has 488 places, 834 transitions, 5186 flow [2024-11-16 23:47:06,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=2536, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5186, PETRI_PLACES=488, PETRI_TRANSITIONS=834} [2024-11-16 23:47:06,565 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, 12 predicate places. [2024-11-16 23:47:06,565 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 834 transitions, 5186 flow [2024-11-16 23:47:06,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 451.6666666666667) internal successors, (2710), 6 states have internal predecessors, (2710), 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-16 23:47:06,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:06,568 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] [2024-11-16 23:47:06,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:47:06,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:47:06,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash -484853580, now seen corresponding path program 1 times [2024-11-16 23:47:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:06,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322851077] [2024-11-16 23:47:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:07,102 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-16 23:47:07,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322851077] [2024-11-16 23:47:07,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322851077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:07,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:07,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313797275] [2024-11-16 23:47:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:07,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:07,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 514 [2024-11-16 23:47:07,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 834 transitions, 5186 flow. Second operand has 6 states, 6 states have (on average 451.8333333333333) internal successors, (2711), 6 states have internal predecessors, (2711), 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-16 23:47:07,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:07,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 514 [2024-11-16 23:47:07,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:15,516 INFO L124 PetriNetUnfolderBase]: 10076/38712 cut-off events. [2024-11-16 23:47:15,517 INFO L125 PetriNetUnfolderBase]: For 71141/81319 co-relation queries the response was YES. [2024-11-16 23:47:15,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93362 conditions, 38712 events. 10076/38712 cut-off events. For 71141/81319 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 496534 event pairs, 1689 based on Foata normal form. 670/36737 useless extension candidates. Maximal degree in co-relation 93295. Up to 11029 conditions per place. [2024-11-16 23:47:16,045 INFO L140 encePairwiseOnDemand]: 499/514 looper letters, 382 selfloop transitions, 495 changer transitions 0/1323 dead transitions. [2024-11-16 23:47:16,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 1323 transitions, 12062 flow [2024-11-16 23:47:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2791 transitions. [2024-11-16 23:47:16,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9049935149156939 [2024-11-16 23:47:16,051 INFO L175 Difference]: Start difference. First operand has 488 places, 834 transitions, 5186 flow. Second operand 6 states and 2791 transitions. [2024-11-16 23:47:16,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 1323 transitions, 12062 flow [2024-11-16 23:47:16,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 1323 transitions, 12062 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:47:16,259 INFO L231 Difference]: Finished difference. Result has 498 places, 1315 transitions, 12532 flow [2024-11-16 23:47:16,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=5186, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12532, PETRI_PLACES=498, PETRI_TRANSITIONS=1315} [2024-11-16 23:47:16,260 INFO L277 CegarLoopForPetriNet]: 476 programPoint places, 22 predicate places. [2024-11-16 23:47:16,261 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 1315 transitions, 12532 flow [2024-11-16 23:47:16,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 451.8333333333333) internal successors, (2711), 6 states have internal predecessors, (2711), 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-16 23:47:16,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:16,262 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] [2024-11-16 23:47:16,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:47:16,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-16 23:47:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1343035687, now seen corresponding path program 1 times [2024-11-16 23:47:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283767827] [2024-11-16 23:47:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:16,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:16,903 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-16 23:47:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283767827] [2024-11-16 23:47:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283767827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:16,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828982611] [2024-11-16 23:47:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:16,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:17,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 514 [2024-11-16 23:47:17,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1315 transitions, 12532 flow. Second operand has 6 states, 6 states have (on average 423.1666666666667) internal successors, (2539), 6 states have internal predecessors, (2539), 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-16 23:47:17,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:17,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 514 [2024-11-16 23:47:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:35,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L67-25-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][359], [Black: 572#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 574#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 583#(= |#race~B~0| 0), Black: 575#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 573#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 581#true, 467#L67-24true, Black: 588#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 618#true, Black: 587#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 590#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 589#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 530#true, 585#true, Black: 534#true, Black: 599#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 598#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 601#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 538#true, Black: 600#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), 596#true, 607#true, 570#true, 248#L51-24true, 529#(= |#race~M~0| 0), 540#(= |#race~C2~0| 0), Black: 610#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 609#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 611#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 612#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 508#(= |#race~N~0| 0), 542#true, 150#L89-1true, Black: 552#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 136#L62true, 536#(= |#race~A~0| 0), Black: 547#(<= ~N~0 0), Black: 554#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 548#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 567#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 566#(<= (+ ~M~0 1) 0), 532#(= |#race~C1~0| 0)]) [2024-11-16 23:47:35,870 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-16 23:47:35,870 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-16 23:47:35,871 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:47:35,871 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event