./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:19:23,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:19:23,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:19:23,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:19:23,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:19:23,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:19:23,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:19:23,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:19:23,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:19:23,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:19:23,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:19:23,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:19:23,407 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:19:23,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:19:23,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:19:23,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:19:23,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:19:23,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:19:23,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:19:23,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:19:23,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:19:23,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:19:23,412 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:19:23,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:19:23,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:19:23,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:19:23,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:19:23,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:19:23,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:19:23,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:19:23,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:19:23,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:19:23,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:19:23,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:19:23,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:19:23,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:19:23,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:19:23,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:19:23,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:19:23,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:19:23,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:19:23,417 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-clean/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-clean/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 -> 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 [2024-10-11 17:19:23,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:19:23,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:19:23,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:19:23,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:19:23,696 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:19:23,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-10-11 17:19:24,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:19:25,129 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:19:25,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-10-11 17:19:25,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/09f4cd0b0/5163ceb3c1f249378c7636aed937fdc6/FLAGaa18a744d [2024-10-11 17:19:25,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/09f4cd0b0/5163ceb3c1f249378c7636aed937fdc6 [2024-10-11 17:19:25,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:19:25,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:19:25,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:19:25,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:19:25,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:19:25,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11de7e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25, skipping insertion in model container [2024-10-11 17:19:25,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:19:25,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:19:25,568 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:19:25,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:19:25,676 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:19:25,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25 WrapperNode [2024-10-11 17:19:25,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:19:25,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:19:25,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:19:25,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:19:25,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,715 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-10-11 17:19:25,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:19:25,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:19:25,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:19:25,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:19:25,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:19:25,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:19:25,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:19:25,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:19:25,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (1/1) ... [2024-10-11 17:19:25,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:19:25,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:19:25,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:19:25,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:19:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:19:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:19:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:19:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:19:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:19:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:19:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:19:25,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:19:25,800 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:19:25,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:19:25,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:19:26,050 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:19:26,050 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:19:26,060 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:19:26,060 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:19:26,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:19:26 BoogieIcfgContainer [2024-10-11 17:19:26,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:19:26,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:19:26,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:19:26,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:19:26,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:19:25" (1/3) ... [2024-10-11 17:19:26,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503c8349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:19:26, skipping insertion in model container [2024-10-11 17:19:26,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:25" (2/3) ... [2024-10-11 17:19:26,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503c8349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:19:26, skipping insertion in model container [2024-10-11 17:19:26,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:19:26" (3/3) ... [2024-10-11 17:19:26,067 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2024-10-11 17:19:26,078 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:19:26,078 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 17:19:26,078 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:19:26,125 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:19:26,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 96 transitions, 199 flow [2024-10-11 17:19:26,191 INFO L124 PetriNetUnfolderBase]: 6/131 cut-off events. [2024-10-11 17:19:26,191 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:19:26,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 131 events. 6/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 229 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2024-10-11 17:19:26,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 96 transitions, 199 flow [2024-10-11 17:19:26,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 199 flow [2024-10-11 17:19:26,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:19:26,211 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;@65205dee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:19:26,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 17:19:26,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:19:26,216 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-10-11 17:19:26,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:19:26,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:26,217 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-10-11 17:19:26,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:26,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash -544149586, now seen corresponding path program 1 times [2024-10-11 17:19:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:26,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189858448] [2024-10-11 17:19:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189858448] [2024-10-11 17:19:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189858448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750582427] [2024-10-11 17:19:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:26,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:26,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96 [2024-10-11 17:19:26,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:26,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:26,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96 [2024-10-11 17:19:26,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:26,581 INFO L124 PetriNetUnfolderBase]: 3/161 cut-off events. [2024-10-11 17:19:26,581 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:19:26,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 161 events. 3/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 2 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 101. Up to 15 conditions per place. [2024-10-11 17:19:26,583 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2024-10-11 17:19:26,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2024-10-11 17:19:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-10-11 17:19:26,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-10-11 17:19:26,597 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 199 flow. Second operand 3 states and 260 transitions. [2024-10-11 17:19:26,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2024-10-11 17:19:26,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:26,603 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2024-10-11 17:19:26,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-10-11 17:19:26,609 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2024-10-11 17:19:26,609 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2024-10-11 17:19:26,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:26,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:26,610 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] [2024-10-11 17:19:26,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:19:26,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:26,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:26,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1305463396, now seen corresponding path program 1 times [2024-10-11 17:19:26,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295656535] [2024-10-11 17:19:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295656535] [2024-10-11 17:19:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295656535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169809448] [2024-10-11 17:19:26,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:26,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:26,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:26,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:26,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-10-11 17:19:26,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:26,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:26,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-10-11 17:19:26,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:26,722 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-10-11 17:19:26,722 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:19:26,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 169 events. 5/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 335 event pairs, 2 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2024-10-11 17:19:26,723 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-10-11 17:19:26,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2024-10-11 17:19:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-10-11 17:19:26,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2024-10-11 17:19:26,726 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2024-10-11 17:19:26,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2024-10-11 17:19:26,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:26,728 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2024-10-11 17:19:26,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-10-11 17:19:26,729 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-10-11 17:19:26,729 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2024-10-11 17:19:26,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:26,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:26,730 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] [2024-10-11 17:19:26,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:19:26,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1732395560, now seen corresponding path program 1 times [2024-10-11 17:19:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999070049] [2024-10-11 17:19:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:27,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999070049] [2024-10-11 17:19:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999070049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:27,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:27,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501022480] [2024-10-11 17:19:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:27,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:27,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:27,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2024-10-11 17:19:27,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:27,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:27,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2024-10-11 17:19:27,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:27,473 INFO L124 PetriNetUnfolderBase]: 73/402 cut-off events. [2024-10-11 17:19:27,474 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:19:27,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 402 events. 73/402 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1947 event pairs, 35 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 501. Up to 159 conditions per place. [2024-10-11 17:19:27,479 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-10-11 17:19:27,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 331 flow [2024-10-11 17:19:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2024-10-11 17:19:27,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2024-10-11 17:19:27,485 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 460 transitions. [2024-10-11 17:19:27,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 331 flow [2024-10-11 17:19:27,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:27,487 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 349 flow [2024-10-11 17:19:27,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2024-10-11 17:19:27,489 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2024-10-11 17:19:27,490 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 349 flow [2024-10-11 17:19:27,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:27,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:27,491 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] [2024-10-11 17:19:27,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:19:27,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1866357126, now seen corresponding path program 1 times [2024-10-11 17:19:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841717218] [2024-10-11 17:19:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841717218] [2024-10-11 17:19:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841717218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162063235] [2024-10-11 17:19:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:27,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:19:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:19:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:19:27,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 96 [2024-10-11 17:19:27,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:27,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:27,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 96 [2024-10-11 17:19:27,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:27,697 INFO L124 PetriNetUnfolderBase]: 34/262 cut-off events. [2024-10-11 17:19:27,697 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-10-11 17:19:27,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 262 events. 34/262 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 933 event pairs, 0 based on Foata normal form. 2/254 useless extension candidates. Maximal degree in co-relation 335. Up to 49 conditions per place. [2024-10-11 17:19:27,699 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 11 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2024-10-11 17:19:27,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 395 flow [2024-10-11 17:19:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2024-10-11 17:19:27,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8663194444444444 [2024-10-11 17:19:27,703 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 349 flow. Second operand 6 states and 499 transitions. [2024-10-11 17:19:27,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 395 flow [2024-10-11 17:19:27,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:27,707 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 367 flow [2024-10-11 17:19:27,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2024-10-11 17:19:27,708 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2024-10-11 17:19:27,709 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 367 flow [2024-10-11 17:19:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:27,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:27,709 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] [2024-10-11 17:19:27,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:19:27,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:27,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1957891883, now seen corresponding path program 1 times [2024-10-11 17:19:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116438170] [2024-10-11 17:19:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:27,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116438170] [2024-10-11 17:19:27,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116438170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:27,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:27,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:27,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230814856] [2024-10-11 17:19:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:27,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:27,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:28,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2024-10-11 17:19:28,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:28,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2024-10-11 17:19:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:28,169 INFO L124 PetriNetUnfolderBase]: 131/506 cut-off events. [2024-10-11 17:19:28,169 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2024-10-11 17:19:28,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 506 events. 131/506 cut-off events. For 135/137 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2624 event pairs, 23 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 1034. Up to 240 conditions per place. [2024-10-11 17:19:28,174 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2024-10-11 17:19:28,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 689 flow [2024-10-11 17:19:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-10-11 17:19:28,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8524305555555556 [2024-10-11 17:19:28,178 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 367 flow. Second operand 6 states and 491 transitions. [2024-10-11 17:19:28,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 689 flow [2024-10-11 17:19:28,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:19:28,183 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2024-10-11 17:19:28,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2024-10-11 17:19:28,186 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-10-11 17:19:28,186 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2024-10-11 17:19:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:28,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:19:28,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:28,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash -676534449, now seen corresponding path program 1 times [2024-10-11 17:19:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:28,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056470969] [2024-10-11 17:19:28,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:19:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:28,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056470969] [2024-10-11 17:19:28,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056470969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801691400] [2024-10-11 17:19:28,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:28,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2024-10-11 17:19:28,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:28,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2024-10-11 17:19:28,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:28,634 INFO L124 PetriNetUnfolderBase]: 142/512 cut-off events. [2024-10-11 17:19:28,634 INFO L125 PetriNetUnfolderBase]: For 432/436 co-relation queries the response was YES. [2024-10-11 17:19:28,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 512 events. 142/512 cut-off events. For 432/436 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2815 event pairs, 10 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1505. Up to 241 conditions per place. [2024-10-11 17:19:28,639 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2024-10-11 17:19:28,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2024-10-11 17:19:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2024-10-11 17:19:28,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8142361111111112 [2024-10-11 17:19:28,640 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2024-10-11 17:19:28,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2024-10-11 17:19:28,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-10-11 17:19:28,657 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2024-10-11 17:19:28,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=114, PETRI_TRANSITIONS=158} [2024-10-11 17:19:28,658 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2024-10-11 17:19:28,659 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2024-10-11 17:19:28,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:28,661 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:28,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:19:28,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:19:28,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash 360110075, now seen corresponding path program 1 times [2024-10-11 17:19:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:28,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200799119] [2024-10-11 17:19:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:19:28,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:19:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:19:28,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:19:28,738 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:19:28,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-11 17:19:28,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-11 17:19:28,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-11 17:19:28,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-11 17:19:28,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-11 17:19:28,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-11 17:19:28,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-11 17:19:28,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-11 17:19:28,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-11 17:19:28,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:19:28,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:28,748 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:19:28,749 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:19:28,771 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:19:28,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 117 transitions, 250 flow [2024-10-11 17:19:28,792 INFO L124 PetriNetUnfolderBase]: 11/223 cut-off events. [2024-10-11 17:19:28,793 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:19:28,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 11/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 488 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2024-10-11 17:19:28,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 117 transitions, 250 flow [2024-10-11 17:19:28,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 117 transitions, 250 flow [2024-10-11 17:19:28,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:19:28,798 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;@65205dee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:19:28,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-11 17:19:28,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:19:28,800 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-10-11 17:19:28,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:19:28,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:28,800 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-10-11 17:19:28,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:28,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1771504451, now seen corresponding path program 1 times [2024-10-11 17:19:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:28,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134983858] [2024-10-11 17:19:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134983858] [2024-10-11 17:19:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134983858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:28,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:28,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890021112] [2024-10-11 17:19:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:28,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:28,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:28,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-10-11 17:19:28,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:28,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-10-11 17:19:28,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:28,880 INFO L124 PetriNetUnfolderBase]: 19/441 cut-off events. [2024-10-11 17:19:28,880 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-11 17:19:28,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 441 events. 19/441 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1876 event pairs, 16 based on Foata normal form. 9/393 useless extension candidates. Maximal degree in co-relation 287. Up to 50 conditions per place. [2024-10-11 17:19:28,882 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2024-10-11 17:19:28,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2024-10-11 17:19:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2024-10-11 17:19:28,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031339031339032 [2024-10-11 17:19:28,884 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 250 flow. Second operand 3 states and 317 transitions. [2024-10-11 17:19:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2024-10-11 17:19:28,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:28,886 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2024-10-11 17:19:28,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2024-10-11 17:19:28,887 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-10-11 17:19:28,887 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2024-10-11 17:19:28,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:28,887 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] [2024-10-11 17:19:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:19:28,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1558441532, now seen corresponding path program 1 times [2024-10-11 17:19:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747306170] [2024-10-11 17:19:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:28,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747306170] [2024-10-11 17:19:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747306170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:28,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382105995] [2024-10-11 17:19:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:28,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:28,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-10-11 17:19:28,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:28,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-10-11 17:19:28,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:28,985 INFO L124 PetriNetUnfolderBase]: 48/598 cut-off events. [2024-10-11 17:19:28,986 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 17:19:28,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 48/598 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2965 event pairs, 27 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 692. Up to 97 conditions per place. [2024-10-11 17:19:28,989 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2024-10-11 17:19:28,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2024-10-11 17:19:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2024-10-11 17:19:28,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905982905982906 [2024-10-11 17:19:28,991 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2024-10-11 17:19:28,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2024-10-11 17:19:28,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:28,994 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2024-10-11 17:19:28,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-10-11 17:19:28,995 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2024-10-11 17:19:28,995 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2024-10-11 17:19:28,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:28,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:28,995 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] [2024-10-11 17:19:28,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:19:28,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:28,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1701174552, now seen corresponding path program 1 times [2024-10-11 17:19:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688811334] [2024-10-11 17:19:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:28,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:29,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:29,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688811334] [2024-10-11 17:19:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688811334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:29,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862520839] [2024-10-11 17:19:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:29,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:29,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2024-10-11 17:19:29,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:29,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:29,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2024-10-11 17:19:29,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:29,639 INFO L124 PetriNetUnfolderBase]: 1014/3169 cut-off events. [2024-10-11 17:19:29,639 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-10-11 17:19:29,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 3169 events. 1014/3169 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26242 event pairs, 586 based on Foata normal form. 0/2847 useless extension candidates. Maximal degree in co-relation 4117. Up to 1592 conditions per place. [2024-10-11 17:19:29,652 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 30 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2024-10-11 17:19:29,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 472 flow [2024-10-11 17:19:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2024-10-11 17:19:29,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8162393162393162 [2024-10-11 17:19:29,656 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 573 transitions. [2024-10-11 17:19:29,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 472 flow [2024-10-11 17:19:29,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:29,659 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 509 flow [2024-10-11 17:19:29,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=125, PETRI_TRANSITIONS=149} [2024-10-11 17:19:29,660 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2024-10-11 17:19:29,660 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 509 flow [2024-10-11 17:19:29,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:29,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:29,661 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] [2024-10-11 17:19:29,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:19:29,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1567212986, now seen corresponding path program 1 times [2024-10-11 17:19:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450444849] [2024-10-11 17:19:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450444849] [2024-10-11 17:19:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450444849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033791862] [2024-10-11 17:19:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:29,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:19:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:19:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:19:29,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 117 [2024-10-11 17:19:29,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 149 transitions, 509 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:29,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:29,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 117 [2024-10-11 17:19:29,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:29,909 INFO L124 PetriNetUnfolderBase]: 481/1741 cut-off events. [2024-10-11 17:19:29,910 INFO L125 PetriNetUnfolderBase]: For 382/462 co-relation queries the response was YES. [2024-10-11 17:19:29,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1741 events. 481/1741 cut-off events. For 382/462 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12358 event pairs, 131 based on Foata normal form. 2/1643 useless extension candidates. Maximal degree in co-relation 2638. Up to 615 conditions per place. [2024-10-11 17:19:29,922 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/155 dead transitions. [2024-10-11 17:19:29,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 563 flow [2024-10-11 17:19:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-10-11 17:19:29,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2024-10-11 17:19:29,924 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 509 flow. Second operand 6 states and 616 transitions. [2024-10-11 17:19:29,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 563 flow [2024-10-11 17:19:29,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 155 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:29,930 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 531 flow [2024-10-11 17:19:29,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=134, PETRI_TRANSITIONS=150} [2024-10-11 17:19:29,932 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2024-10-11 17:19:29,932 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 531 flow [2024-10-11 17:19:29,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:29,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:29,934 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] [2024-10-11 17:19:29,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:19:29,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682072, now seen corresponding path program 1 times [2024-10-11 17:19:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767441526] [2024-10-11 17:19:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767441526] [2024-10-11 17:19:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767441526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706902753] [2024-10-11 17:19:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:30,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-10-11 17:19:30,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:30,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:30,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-10-11 17:19:30,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:30,984 INFO L124 PetriNetUnfolderBase]: 2425/6842 cut-off events. [2024-10-11 17:19:30,985 INFO L125 PetriNetUnfolderBase]: For 1864/2249 co-relation queries the response was YES. [2024-10-11 17:19:31,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 6842 events. 2425/6842 cut-off events. For 1864/2249 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 62494 event pairs, 537 based on Foata normal form. 17/6325 useless extension candidates. Maximal degree in co-relation 14831. Up to 2882 conditions per place. [2024-10-11 17:19:31,073 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2024-10-11 17:19:31,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 1359 flow [2024-10-11 17:19:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2024-10-11 17:19:31,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874643874643875 [2024-10-11 17:19:31,076 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 531 flow. Second operand 6 states and 623 transitions. [2024-10-11 17:19:31,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 1359 flow [2024-10-11 17:19:31,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:19:31,087 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2024-10-11 17:19:31,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=136, PETRI_TRANSITIONS=233} [2024-10-11 17:19:31,088 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2024-10-11 17:19:31,088 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2024-10-11 17:19:31,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:31,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:31,088 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] [2024-10-11 17:19:31,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:19:31,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:31,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1833776535, now seen corresponding path program 1 times [2024-10-11 17:19:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:31,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002204096] [2024-10-11 17:19:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:19:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:31,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002204096] [2024-10-11 17:19:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002204096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:31,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:31,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292731008] [2024-10-11 17:19:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:31,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:31,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:31,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2024-10-11 17:19:31,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 233 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:31,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:31,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2024-10-11 17:19:31,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:32,303 INFO L124 PetriNetUnfolderBase]: 3064/8860 cut-off events. [2024-10-11 17:19:32,304 INFO L125 PetriNetUnfolderBase]: For 6913/7212 co-relation queries the response was YES. [2024-10-11 17:19:32,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24607 conditions, 8860 events. 3064/8860 cut-off events. For 6913/7212 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 88155 event pairs, 525 based on Foata normal form. 14/8296 useless extension candidates. Maximal degree in co-relation 23620. Up to 4186 conditions per place. [2024-10-11 17:19:32,368 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2024-10-11 17:19:32,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2024-10-11 17:19:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2024-10-11 17:19:32,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8319088319088319 [2024-10-11 17:19:32,371 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2024-10-11 17:19:32,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2024-10-11 17:19:32,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:32,406 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2024-10-11 17:19:32,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2007, PETRI_PLACES=146, PETRI_TRANSITIONS=299} [2024-10-11 17:19:32,407 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2024-10-11 17:19:32,407 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2024-10-11 17:19:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:32,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:32,408 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:32,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:19:32,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2096755450, now seen corresponding path program 1 times [2024-10-11 17:19:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477713183] [2024-10-11 17:19:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:19:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477713183] [2024-10-11 17:19:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477713183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:19:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083895918] [2024-10-11 17:19:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:32,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:19:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:19:32,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:19:32,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:19:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:32,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 17:19:32,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:19:33,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:19:33,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:19:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:19:33,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:19:33,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:19:33,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:19:33,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:19:33,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:19:33,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:19:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-11 17:19:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:19:33,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:19:35,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet10#1| (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-10-11 17:19:39,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:19:39,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-11 17:19:39,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:19:39,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-10-11 17:19:39,162 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:19:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:19:39,166 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:19:39,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:19:39,174 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:19:39,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:19:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-10-11 17:19:39,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083895918] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:19:39,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:19:39,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-11 17:19:39,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935535938] [2024-10-11 17:19:39,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:19:39,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:19:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:19:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=162, Unknown=30, NotChecked=28, Total=272 [2024-10-11 17:19:39,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 117 [2024-10-11 17:19:39,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 17 states, 17 states have (on average 64.29411764705883) internal successors, (1093), 17 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:39,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:39,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 117 [2024-10-11 17:19:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:41,804 INFO L124 PetriNetUnfolderBase]: 8340/18854 cut-off events. [2024-10-11 17:19:41,804 INFO L125 PetriNetUnfolderBase]: For 24174/24181 co-relation queries the response was YES. [2024-10-11 17:19:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58389 conditions, 18854 events. 8340/18854 cut-off events. For 24174/24181 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 186968 event pairs, 2798 based on Foata normal form. 172/18023 useless extension candidates. Maximal degree in co-relation 56426. Up to 8310 conditions per place. [2024-10-11 17:19:41,938 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 389 selfloop transitions, 36 changer transitions 0/490 dead transitions. [2024-10-11 17:19:41,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 490 transitions, 4293 flow [2024-10-11 17:19:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:19:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 17:19:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 942 transitions. [2024-10-11 17:19:41,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193293885601578 [2024-10-11 17:19:41,941 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 942 transitions. [2024-10-11 17:19:41,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 490 transitions, 4293 flow [2024-10-11 17:19:42,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 490 transitions, 4153 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:42,013 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2024-10-11 17:19:42,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1935, PETRI_PLACES=157, PETRI_TRANSITIONS=298} [2024-10-11 17:19:42,015 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2024-10-11 17:19:42,015 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2024-10-11 17:19:42,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.29411764705883) internal successors, (1093), 17 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:42,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:42,016 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:42,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:19:42,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:19:42,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:42,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 210699178, now seen corresponding path program 1 times [2024-10-11 17:19:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162308717] [2024-10-11 17:19:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:42,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162308717] [2024-10-11 17:19:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162308717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:19:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996932266] [2024-10-11 17:19:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:42,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:19:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:19:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:19:43,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-10-11 17:19:43,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 298 transitions, 1935 flow. Second operand has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:43,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:43,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-10-11 17:19:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:44,939 INFO L124 PetriNetUnfolderBase]: 5095/13018 cut-off events. [2024-10-11 17:19:44,939 INFO L125 PetriNetUnfolderBase]: For 18405/20352 co-relation queries the response was YES. [2024-10-11 17:19:44,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43784 conditions, 13018 events. 5095/13018 cut-off events. For 18405/20352 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 128842 event pairs, 581 based on Foata normal form. 295/12773 useless extension candidates. Maximal degree in co-relation 39872. Up to 3164 conditions per place. [2024-10-11 17:19:45,020 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2024-10-11 17:19:45,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2024-10-11 17:19:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 17:19:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 17:19:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2024-10-11 17:19:45,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2024-10-11 17:19:45,024 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2024-10-11 17:19:45,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2024-10-11 17:19:45,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-10-11 17:19:45,076 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2024-10-11 17:19:45,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4571, PETRI_PLACES=172, PETRI_TRANSITIONS=504} [2024-10-11 17:19:45,079 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2024-10-11 17:19:45,079 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2024-10-11 17:19:45,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:45,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:45,080 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] [2024-10-11 17:19:45,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:19:45,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:45,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1121471070, now seen corresponding path program 1 times [2024-10-11 17:19:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267854342] [2024-10-11 17:19:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:19:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267854342] [2024-10-11 17:19:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267854342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:19:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506679930] [2024-10-11 17:19:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:45,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:19:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:19:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:19:45,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-10-11 17:19:45,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 504 transitions, 4571 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:45,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:45,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-10-11 17:19:45,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:47,520 INFO L124 PetriNetUnfolderBase]: 4491/12035 cut-off events. [2024-10-11 17:19:47,521 INFO L125 PetriNetUnfolderBase]: For 34324/34927 co-relation queries the response was YES. [2024-10-11 17:19:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48039 conditions, 12035 events. 4491/12035 cut-off events. For 34324/34927 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 121162 event pairs, 444 based on Foata normal form. 184/11650 useless extension candidates. Maximal degree in co-relation 46664. Up to 3243 conditions per place. [2024-10-11 17:19:47,600 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2024-10-11 17:19:47,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2024-10-11 17:19:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:19:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 17:19:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2024-10-11 17:19:47,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7218934911242604 [2024-10-11 17:19:47,603 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2024-10-11 17:19:47,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2024-10-11 17:19:47,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-10-11 17:19:47,748 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2024-10-11 17:19:47,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4585, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2024-10-11 17:19:47,750 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2024-10-11 17:19:47,750 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2024-10-11 17:19:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:47,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:47,750 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:47,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:19:47,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1249667111, now seen corresponding path program 1 times [2024-10-11 17:19:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234498902] [2024-10-11 17:19:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:19:47,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234498902] [2024-10-11 17:19:47,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234498902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:47,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:47,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057275420] [2024-10-11 17:19:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:47,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:47,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:47,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:47,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-10-11 17:19:47,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 4585 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:47,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:47,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-10-11 17:19:47,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:48,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][342], [Black: 130#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 612#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 132#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 131#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 129#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 66#L1022-7true, 118#true, 95#L1022-11true, Black: 140#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 570#true, Black: 579#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 592#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 577#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 67#L1036-1true, Black: 576#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 590#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 578#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 151#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 596#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 594#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 152#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 580#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 575#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 161#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 149#true, 159#true, 125#(= |#race~datas~0| 0), 116#true, 127#true, 636#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 123#true]) [2024-10-11 17:19:48,826 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-10-11 17:19:48,826 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-10-11 17:19:48,826 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-10-11 17:19:48,826 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-10-11 17:19:51,086 INFO L124 PetriNetUnfolderBase]: 9630/21884 cut-off events. [2024-10-11 17:19:51,086 INFO L125 PetriNetUnfolderBase]: For 73818/75081 co-relation queries the response was YES. [2024-10-11 17:19:51,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89397 conditions, 21884 events. 9630/21884 cut-off events. For 73818/75081 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 223544 event pairs, 1075 based on Foata normal form. 11/20753 useless extension candidates. Maximal degree in co-relation 87307. Up to 11074 conditions per place. [2024-10-11 17:19:51,249 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2024-10-11 17:19:51,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2024-10-11 17:19:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2024-10-11 17:19:51,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8817663817663818 [2024-10-11 17:19:51,256 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2024-10-11 17:19:51,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2024-10-11 17:19:51,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-10-11 17:19:51,705 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2024-10-11 17:19:51,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8336, PETRI_PLACES=175, PETRI_TRANSITIONS=778} [2024-10-11 17:19:51,706 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2024-10-11 17:19:51,706 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2024-10-11 17:19:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:51,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:51,707 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:51,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:19:51,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:19:51,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103095, now seen corresponding path program 1 times [2024-10-11 17:19:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:51,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086616679] [2024-10-11 17:19:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:19:51,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:19:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:19:51,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:19:51,766 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:19:51,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-11 17:19:51,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-11 17:19:51,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-11 17:19:51,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-11 17:19:51,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-11 17:19:51,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-10-11 17:19:51,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-11 17:19:51,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-11 17:19:51,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-11 17:19:51,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-11 17:19:51,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-11 17:19:51,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:19:51,768 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:51,769 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:19:51,769 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:19:51,788 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:19:51,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 303 flow [2024-10-11 17:19:51,821 INFO L124 PetriNetUnfolderBase]: 21/368 cut-off events. [2024-10-11 17:19:51,822 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-10-11 17:19:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 368 events. 21/368 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1024 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 231. Up to 16 conditions per place. [2024-10-11 17:19:51,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 138 transitions, 303 flow [2024-10-11 17:19:51,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 303 flow [2024-10-11 17:19:51,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:19:51,829 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;@65205dee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:19:51,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 17:19:51,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:19:51,831 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-10-11 17:19:51,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:19:51,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:51,831 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-10-11 17:19:51,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:19:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1113706995, now seen corresponding path program 1 times [2024-10-11 17:19:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112965287] [2024-10-11 17:19:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112965287] [2024-10-11 17:19:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112965287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:51,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:51,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080503374] [2024-10-11 17:19:51,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:51,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:51,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-10-11 17:19:51,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:51,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:51,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-10-11 17:19:51,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:51,984 INFO L124 PetriNetUnfolderBase]: 90/1260 cut-off events. [2024-10-11 17:19:51,984 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-10-11 17:19:51,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 90/1260 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8329 event pairs, 81 based on Foata normal form. 25/1116 useless extension candidates. Maximal degree in co-relation 877. Up to 178 conditions per place. [2024-10-11 17:19:51,990 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2024-10-11 17:19:51,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2024-10-11 17:19:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-10-11 17:19:51,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2024-10-11 17:19:51,992 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 303 flow. Second operand 3 states and 374 transitions. [2024-10-11 17:19:51,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2024-10-11 17:19:51,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:51,994 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2024-10-11 17:19:51,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-10-11 17:19:51,995 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2024-10-11 17:19:51,995 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2024-10-11 17:19:51,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:51,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:51,995 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] [2024-10-11 17:19:51,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:19:51,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:19:51,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1671261316, now seen corresponding path program 1 times [2024-10-11 17:19:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520845189] [2024-10-11 17:19:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520845189] [2024-10-11 17:19:52,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520845189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:52,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:52,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954103128] [2024-10-11 17:19:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:52,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:52,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-10-11 17:19:52,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:52,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:52,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-10-11 17:19:52,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:52,237 INFO L124 PetriNetUnfolderBase]: 307/2452 cut-off events. [2024-10-11 17:19:52,238 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2024-10-11 17:19:52,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2452 events. 307/2452 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19851 event pairs, 214 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 3039. Up to 507 conditions per place. [2024-10-11 17:19:52,250 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-10-11 17:19:52,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2024-10-11 17:19:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-10-11 17:19:52,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-10-11 17:19:52,252 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2024-10-11 17:19:52,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2024-10-11 17:19:52,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:52,254 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2024-10-11 17:19:52,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-10-11 17:19:52,255 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2024-10-11 17:19:52,255 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2024-10-11 17:19:52,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:52,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:52,255 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] [2024-10-11 17:19:52,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:19:52,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:19:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1076870248, now seen corresponding path program 1 times [2024-10-11 17:19:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159831032] [2024-10-11 17:19:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159831032] [2024-10-11 17:19:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159831032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930122175] [2024-10-11 17:19:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:52,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 138 [2024-10-11 17:19:52,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:52,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:52,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 138 [2024-10-11 17:19:52,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:54,588 INFO L124 PetriNetUnfolderBase]: 10379/23786 cut-off events. [2024-10-11 17:19:54,588 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2024-10-11 17:19:54,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39831 conditions, 23786 events. 10379/23786 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 241511 event pairs, 6716 based on Foata normal form. 0/21792 useless extension candidates. Maximal degree in co-relation 32196. Up to 14165 conditions per place. [2024-10-11 17:19:54,700 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 37 selfloop transitions, 54 changer transitions 0/188 dead transitions. [2024-10-11 17:19:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 617 flow [2024-10-11 17:19:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2024-10-11 17:19:54,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2024-10-11 17:19:54,702 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 686 transitions. [2024-10-11 17:19:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 617 flow [2024-10-11 17:19:54,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 188 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:54,706 INFO L231 Difference]: Finished difference. Result has 146 places, 186 transitions, 671 flow [2024-10-11 17:19:54,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=146, PETRI_TRANSITIONS=186} [2024-10-11 17:19:54,706 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2024-10-11 17:19:54,706 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 186 transitions, 671 flow [2024-10-11 17:19:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:54,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:54,707 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] [2024-10-11 17:19:54,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:19:54,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:19:54,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1210831814, now seen corresponding path program 1 times [2024-10-11 17:19:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609196850] [2024-10-11 17:19:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609196850] [2024-10-11 17:19:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609196850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:54,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575638567] [2024-10-11 17:19:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:54,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:19:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:19:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:19:54,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-10-11 17:19:54,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 186 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:54,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:54,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-10-11 17:19:54,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:56,016 INFO L124 PetriNetUnfolderBase]: 4742/12157 cut-off events. [2024-10-11 17:19:56,016 INFO L125 PetriNetUnfolderBase]: For 3135/3635 co-relation queries the response was YES. [2024-10-11 17:19:56,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23497 conditions, 12157 events. 4742/12157 cut-off events. For 3135/3635 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 114328 event pairs, 1822 based on Foata normal form. 2/11490 useless extension candidates. Maximal degree in co-relation 19222. Up to 5587 conditions per place. [2024-10-11 17:19:56,071 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 16 selfloop transitions, 2 changer transitions 5/192 dead transitions. [2024-10-11 17:19:56,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 192 transitions, 729 flow [2024-10-11 17:19:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2024-10-11 17:19:56,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-10-11 17:19:56,072 INFO L175 Difference]: Start difference. First operand has 146 places, 186 transitions, 671 flow. Second operand 6 states and 732 transitions. [2024-10-11 17:19:56,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 192 transitions, 729 flow [2024-10-11 17:19:56,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 192 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:56,090 INFO L231 Difference]: Finished difference. Result has 155 places, 187 transitions, 693 flow [2024-10-11 17:19:56,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=155, PETRI_TRANSITIONS=187} [2024-10-11 17:19:56,090 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 16 predicate places. [2024-10-11 17:19:56,090 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 187 transitions, 693 flow [2024-10-11 17:19:56,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:56,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:56,091 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] [2024-10-11 17:19:56,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:19:56,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:19:56,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1389642421, now seen corresponding path program 1 times [2024-10-11 17:19:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:56,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035483047] [2024-10-11 17:19:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035483047] [2024-10-11 17:19:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035483047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:56,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114566585] [2024-10-11 17:19:56,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:56,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:19:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:19:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:19:56,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 138 [2024-10-11 17:19:56,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 187 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:56,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:56,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 138 [2024-10-11 17:19:56,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:59,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [88#L1022-7true, Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-10-11 17:19:59,551 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-10-11 17:19:59,552 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-11 17:19:59,552 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-11 17:19:59,552 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-11 17:19:59,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 78#L1022-8true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-10-11 17:19:59,720 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-10-11 17:19:59,720 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-11 17:19:59,720 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-11 17:19:59,720 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-11 17:19:59,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 34#L1022-9true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-10-11 17:19:59,995 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-10-11 17:19:59,995 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:19:59,995 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:19:59,995 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:20:00,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 115#L1022-7true, 171#true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, 93#L1022-10true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-10-11 17:20:00,129 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-10-11 17:20:00,129 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:20:00,129 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:20:00,129 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:20:02,830 INFO L124 PetriNetUnfolderBase]: 29047/67038 cut-off events. [2024-10-11 17:20:02,830 INFO L125 PetriNetUnfolderBase]: For 19554/23332 co-relation queries the response was YES. [2024-10-11 17:20:03,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151012 conditions, 67038 events. 29047/67038 cut-off events. For 19554/23332 co-relation queries the response was YES. Maximal size of possible extension queue 2164. Compared 771800 event pairs, 6939 based on Foata normal form. 87/61871 useless extension candidates. Maximal degree in co-relation 150909. Up to 28700 conditions per place. [2024-10-11 17:20:03,284 INFO L140 encePairwiseOnDemand]: 115/138 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2024-10-11 17:20:03,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 349 transitions, 1957 flow [2024-10-11 17:20:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2024-10-11 17:20:03,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973429951690821 [2024-10-11 17:20:03,285 INFO L175 Difference]: Start difference. First operand has 155 places, 187 transitions, 693 flow. Second operand 6 states and 743 transitions. [2024-10-11 17:20:03,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 349 transitions, 1957 flow [2024-10-11 17:20:03,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:20:03,373 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2024-10-11 17:20:03,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=157, PETRI_TRANSITIONS=304} [2024-10-11 17:20:03,374 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2024-10-11 17:20:03,374 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2024-10-11 17:20:03,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:03,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:03,374 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] [2024-10-11 17:20:03,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:20:03,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:20:03,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1362260044, now seen corresponding path program 1 times [2024-10-11 17:20:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227074358] [2024-10-11 17:20:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:20:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:03,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227074358] [2024-10-11 17:20:03,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227074358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:03,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:03,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346180814] [2024-10-11 17:20:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:03,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:03,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:03,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:03,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 138 [2024-10-11 17:20:03,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 304 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:03,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:03,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 138 [2024-10-11 17:20:03,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:12,852 INFO L124 PetriNetUnfolderBase]: 35337/82836 cut-off events. [2024-10-11 17:20:12,853 INFO L125 PetriNetUnfolderBase]: For 74578/77386 co-relation queries the response was YES. [2024-10-11 17:20:13,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242202 conditions, 82836 events. 35337/82836 cut-off events. For 74578/77386 co-relation queries the response was YES. Maximal size of possible extension queue 2670. Compared 1002516 event pairs, 8904 based on Foata normal form. 186/77295 useless extension candidates. Maximal degree in co-relation 232468. Up to 43542 conditions per place. [2024-10-11 17:20:13,646 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2024-10-11 17:20:13,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2024-10-11 17:20:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2024-10-11 17:20:13,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417874396135265 [2024-10-11 17:20:13,648 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2024-10-11 17:20:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2024-10-11 17:20:14,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:14,227 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2024-10-11 17:20:14,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2981, PETRI_PLACES=167, PETRI_TRANSITIONS=409} [2024-10-11 17:20:14,228 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2024-10-11 17:20:14,228 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2024-10-11 17:20:14,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:14,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:14,228 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:20:14,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-11 17:20:14,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1695343455, now seen corresponding path program 1 times [2024-10-11 17:20:14,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:14,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640386747] [2024-10-11 17:20:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:14,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:20:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640386747] [2024-10-11 17:20:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640386747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770769459] [2024-10-11 17:20:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:14,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:14,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:14,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process