./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:04:28,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:04:28,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:04:28,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:04:28,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:04:28,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:04:28,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:04:28,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:04:28,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:04:28,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:04:28,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:04:28,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:04:28,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:04:28,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:04:28,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:04:28,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:04:28,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:04:28,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:04:28,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:04:28,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:04:28,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:04:28,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:04:28,941 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:04:28,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:04:28,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:04:28,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:04:28,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:04:28,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:04:28,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:04:28,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:04:28,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:04:28,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:04:28,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:04:28,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:04:28,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:04:28,944 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 [2024-11-09 07:04:29,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:04:29,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:04:29,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:04:29,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:04:29,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:04:29,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i [2024-11-09 07:04:30,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:04:30,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:04:30,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i [2024-11-09 07:04:30,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e276f9563/a8c68052299745578fafa363e48ca872/FLAG68a89c836 [2024-11-09 07:04:30,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e276f9563/a8c68052299745578fafa363e48ca872 [2024-11-09 07:04:30,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:04:30,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:04:30,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:04:30,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:04:30,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:04:30,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:04:30" (1/1) ... [2024-11-09 07:04:30,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a81cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:30, skipping insertion in model container [2024-11-09 07:04:30,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:04:30" (1/1) ... [2024-11-09 07:04:30,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:04:31,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:04:31,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:04:31,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:04:31,108 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:04:31,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31 WrapperNode [2024-11-09 07:04:31,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:04:31,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:04:31,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:04:31,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:04:31,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,151 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-09 07:04:31,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:04:31,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:04:31,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:04:31,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:04:31,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:04:31,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:04:31,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:04:31,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:04:31,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (1/1) ... [2024-11-09 07:04:31,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:04:31,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:04:31,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:04:31,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:04:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:04:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:04:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:04:31,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:04:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:04:31,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:04:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:04:31,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:04:31,242 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:04:31,346 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:04:31,348 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:04:31,513 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:04:31,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:04:31,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:04:31,526 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:04:31,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:04:31 BoogieIcfgContainer [2024-11-09 07:04:31,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:04:31,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:04:31,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:04:31,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:04:31,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:04:30" (1/3) ... [2024-11-09 07:04:31,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2efa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:04:31, skipping insertion in model container [2024-11-09 07:04:31,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:31" (2/3) ... [2024-11-09 07:04:31,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2efa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:04:31, skipping insertion in model container [2024-11-09 07:04:31,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:04:31" (3/3) ... [2024-11-09 07:04:31,534 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i [2024-11-09 07:04:31,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:04:31,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 07:04:31,547 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:04:31,603 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 07:04:31,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 96 transitions, 199 flow [2024-11-09 07:04:31,682 INFO L124 PetriNetUnfolderBase]: 6/131 cut-off events. [2024-11-09 07:04:31,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:04:31,690 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-11-09 07:04:31,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 96 transitions, 199 flow [2024-11-09 07:04:31,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 199 flow [2024-11-09 07:04:31,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:04:31,716 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;@3fa07db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:04:31,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 07:04:31,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:04:31,725 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-09 07:04:31,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:04:31,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:31,726 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:31,729 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-11-09 07:04:31,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -544149586, now seen corresponding path program 1 times [2024-11-09 07:04:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572165002] [2024-11-09 07:04:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:31,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572165002] [2024-11-09 07:04:31,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572165002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:31,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790182640] [2024-11-09 07:04:31,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:32,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96 [2024-11-09 07:04:32,057 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-11-09 07:04:32,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:32,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96 [2024-11-09 07:04:32,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:32,093 INFO L124 PetriNetUnfolderBase]: 3/161 cut-off events. [2024-11-09 07:04:32,094 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:04:32,094 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-11-09 07:04:32,096 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2024-11-09 07:04:32,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2024-11-09 07:04:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-09 07:04:32,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-09 07:04:32,110 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 199 flow. Second operand 3 states and 260 transitions. [2024-11-09 07:04:32,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2024-11-09 07:04:32,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:32,115 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2024-11-09 07:04:32,118 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-11-09 07:04:32,122 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2024-11-09 07:04:32,122 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2024-11-09 07:04:32,123 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-11-09 07:04:32,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:32,123 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-11-09 07:04:32,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:04:32,123 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-11-09 07:04:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1305463396, now seen corresponding path program 1 times [2024-11-09 07:04:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312750292] [2024-11-09 07:04:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312750292] [2024-11-09 07:04:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312750292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394612612] [2024-11-09 07:04:32,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:32,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:32,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:32,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:32,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-11-09 07:04:32,223 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-11-09 07:04:32,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:32,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-11-09 07:04:32,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:32,261 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-11-09 07:04:32,261 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 07:04:32,262 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-11-09 07:04:32,263 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-11-09 07:04:32,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2024-11-09 07:04:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-09 07:04:32,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2024-11-09 07:04:32,268 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2024-11-09 07:04:32,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2024-11-09 07:04:32,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:04:32,272 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2024-11-09 07:04:32,272 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-11-09 07:04:32,273 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-11-09 07:04:32,273 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2024-11-09 07:04:32,273 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-11-09 07:04:32,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:32,273 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-11-09 07:04:32,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:04:32,273 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-11-09 07:04:32,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1732395560, now seen corresponding path program 1 times [2024-11-09 07:04:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:32,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616778371] [2024-11-09 07:04:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616778371] [2024-11-09 07:04:32,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616778371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:32,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935947300] [2024-11-09 07:04:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:32,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:32,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2024-11-09 07:04:32,864 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-11-09 07:04:32,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:32,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2024-11-09 07:04:32,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:32,968 INFO L124 PetriNetUnfolderBase]: 73/402 cut-off events. [2024-11-09 07:04:32,968 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:04:32,969 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-11-09 07:04:32,970 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-11-09 07:04:32,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 331 flow [2024-11-09 07:04:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2024-11-09 07:04:32,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2024-11-09 07:04:32,972 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 460 transitions. [2024-11-09 07:04:32,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 331 flow [2024-11-09 07:04:32,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:32,978 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 349 flow [2024-11-09 07:04:32,978 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-11-09 07:04:32,979 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2024-11-09 07:04:32,979 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 349 flow [2024-11-09 07:04:32,979 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-11-09 07:04:32,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:32,979 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-11-09 07:04:32,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:04:32,979 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-11-09 07:04:32,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1866357126, now seen corresponding path program 1 times [2024-11-09 07:04:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:32,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645722007] [2024-11-09 07:04:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645722007] [2024-11-09 07:04:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645722007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248690583] [2024-11-09 07:04:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:33,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:04:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:04:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:04:33,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 96 [2024-11-09 07:04:33,147 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-11-09 07:04:33,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:33,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 96 [2024-11-09 07:04:33,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:33,193 INFO L124 PetriNetUnfolderBase]: 34/262 cut-off events. [2024-11-09 07:04:33,193 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-11-09 07:04:33,194 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-11-09 07:04:33,195 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 11 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2024-11-09 07:04:33,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 395 flow [2024-11-09 07:04:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2024-11-09 07:04:33,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8663194444444444 [2024-11-09 07:04:33,212 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 349 flow. Second operand 6 states and 499 transitions. [2024-11-09 07:04:33,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 395 flow [2024-11-09 07:04:33,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:33,218 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 367 flow [2024-11-09 07:04:33,218 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-11-09 07:04:33,219 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2024-11-09 07:04:33,219 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 367 flow [2024-11-09 07:04:33,220 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-11-09 07:04:33,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:33,220 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-11-09 07:04:33,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:04:33,221 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-11-09 07:04:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1957891883, now seen corresponding path program 1 times [2024-11-09 07:04:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109950326] [2024-11-09 07:04:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109950326] [2024-11-09 07:04:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109950326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7051283] [2024-11-09 07:04:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:33,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:33,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2024-11-09 07:04:33,556 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-11-09 07:04:33,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:33,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2024-11-09 07:04:33,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:33,707 INFO L124 PetriNetUnfolderBase]: 131/506 cut-off events. [2024-11-09 07:04:33,708 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2024-11-09 07:04:33,711 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-11-09 07:04:33,713 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2024-11-09 07:04:33,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 689 flow [2024-11-09 07:04:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-11-09 07:04:33,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8524305555555556 [2024-11-09 07:04:33,715 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 367 flow. Second operand 6 states and 491 transitions. [2024-11-09 07:04:33,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 689 flow [2024-11-09 07:04:33,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 07:04:33,722 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2024-11-09 07:04:33,722 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-11-09 07:04:33,722 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-11-09 07:04:33,723 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2024-11-09 07:04:33,723 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-11-09 07:04:33,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:33,724 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-11-09 07:04:33,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:04:33,724 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-11-09 07:04:33,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash -676534449, now seen corresponding path program 1 times [2024-11-09 07:04:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:33,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432491604] [2024-11-09 07:04:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:04:33,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432491604] [2024-11-09 07:04:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432491604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030096768] [2024-11-09 07:04:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:34,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2024-11-09 07:04:34,078 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-11-09 07:04:34,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:34,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2024-11-09 07:04:34,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:34,158 INFO L124 PetriNetUnfolderBase]: 142/512 cut-off events. [2024-11-09 07:04:34,158 INFO L125 PetriNetUnfolderBase]: For 432/436 co-relation queries the response was YES. [2024-11-09 07:04:34,159 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-11-09 07:04:34,161 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2024-11-09 07:04:34,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2024-11-09 07:04:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2024-11-09 07:04:34,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8142361111111112 [2024-11-09 07:04:34,163 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2024-11-09 07:04:34,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2024-11-09 07:04:34,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-09 07:04:34,170 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2024-11-09 07:04:34,170 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-11-09 07:04:34,170 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2024-11-09 07:04:34,171 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2024-11-09 07:04:34,171 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-11-09 07:04:34,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:34,171 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-11-09 07:04:34,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:04:34,172 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-11-09 07:04:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 360110075, now seen corresponding path program 1 times [2024-11-09 07:04:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471576089] [2024-11-09 07:04:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:04:34,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:04:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:04:34,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:04:34,223 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:04:34,223 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-09 07:04:34,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-09 07:04:34,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-09 07:04:34,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-09 07:04:34,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-09 07:04:34,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-09 07:04:34,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-09 07:04:34,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-09 07:04:34,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-09 07:04:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:04:34,230 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:34,231 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 07:04:34,231 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 07:04:34,245 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:04:34,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 117 transitions, 250 flow [2024-11-09 07:04:34,261 INFO L124 PetriNetUnfolderBase]: 11/223 cut-off events. [2024-11-09 07:04:34,261 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:04:34,262 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-11-09 07:04:34,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 117 transitions, 250 flow [2024-11-09 07:04:34,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 117 transitions, 250 flow [2024-11-09 07:04:34,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:04:34,264 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;@3fa07db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:04:34,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 07:04:34,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:04:34,266 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-09 07:04:34,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:04:34,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:34,266 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:34,266 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-11-09 07:04:34,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1771504451, now seen corresponding path program 1 times [2024-11-09 07:04:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:34,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018839596] [2024-11-09 07:04:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018839596] [2024-11-09 07:04:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018839596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:34,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629374906] [2024-11-09 07:04:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:34,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:34,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-11-09 07:04:34,299 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-11-09 07:04:34,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:34,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-11-09 07:04:34,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:34,337 INFO L124 PetriNetUnfolderBase]: 19/441 cut-off events. [2024-11-09 07:04:34,337 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 07:04:34,338 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-11-09 07:04:34,339 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2024-11-09 07:04:34,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2024-11-09 07:04:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2024-11-09 07:04:34,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031339031339032 [2024-11-09 07:04:34,341 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 250 flow. Second operand 3 states and 317 transitions. [2024-11-09 07:04:34,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2024-11-09 07:04:34,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:34,342 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2024-11-09 07:04:34,343 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-11-09 07:04:34,343 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-09 07:04:34,343 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2024-11-09 07:04:34,344 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-11-09 07:04:34,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:34,344 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-11-09 07:04:34,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:04:34,344 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-11-09 07:04:34,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:34,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1558441532, now seen corresponding path program 1 times [2024-11-09 07:04:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:34,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701418571] [2024-11-09 07:04:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:34,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701418571] [2024-11-09 07:04:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701418571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854795517] [2024-11-09 07:04:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:34,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:34,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-11-09 07:04:34,381 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-11-09 07:04:34,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:34,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-11-09 07:04:34,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:34,449 INFO L124 PetriNetUnfolderBase]: 48/598 cut-off events. [2024-11-09 07:04:34,450 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-09 07:04:34,451 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-11-09 07:04:34,452 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2024-11-09 07:04:34,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2024-11-09 07:04:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2024-11-09 07:04:34,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905982905982906 [2024-11-09 07:04:34,454 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2024-11-09 07:04:34,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2024-11-09 07:04:34,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:04:34,456 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2024-11-09 07:04:34,456 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-11-09 07:04:34,458 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2024-11-09 07:04:34,458 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2024-11-09 07:04:34,458 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-11-09 07:04:34,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:34,459 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-11-09 07:04:34,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:04:34,459 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-11-09 07:04:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1701174552, now seen corresponding path program 1 times [2024-11-09 07:04:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400245767] [2024-11-09 07:04:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:34,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:34,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400245767] [2024-11-09 07:04:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400245767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:34,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899133067] [2024-11-09 07:04:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:34,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:34,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2024-11-09 07:04:34,708 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-11-09 07:04:34,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:34,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2024-11-09 07:04:34,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:35,040 INFO L124 PetriNetUnfolderBase]: 1014/3169 cut-off events. [2024-11-09 07:04:35,040 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-09 07:04:35,045 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-11-09 07:04:35,054 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 30 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2024-11-09 07:04:35,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 472 flow [2024-11-09 07:04:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2024-11-09 07:04:35,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8162393162393162 [2024-11-09 07:04:35,056 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 573 transitions. [2024-11-09 07:04:35,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 472 flow [2024-11-09 07:04:35,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:35,058 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 509 flow [2024-11-09 07:04:35,059 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-11-09 07:04:35,059 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2024-11-09 07:04:35,059 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 509 flow [2024-11-09 07:04:35,060 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-11-09 07:04:35,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:35,060 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-11-09 07:04:35,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:04:35,060 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-11-09 07:04:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1567212986, now seen corresponding path program 1 times [2024-11-09 07:04:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151977059] [2024-11-09 07:04:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151977059] [2024-11-09 07:04:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151977059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:35,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149961329] [2024-11-09 07:04:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:04:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:04:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:04:35,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 117 [2024-11-09 07:04:35,173 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-11-09 07:04:35,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:35,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 117 [2024-11-09 07:04:35,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:35,337 INFO L124 PetriNetUnfolderBase]: 481/1741 cut-off events. [2024-11-09 07:04:35,338 INFO L125 PetriNetUnfolderBase]: For 382/462 co-relation queries the response was YES. [2024-11-09 07:04:35,343 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-11-09 07:04:35,349 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/155 dead transitions. [2024-11-09 07:04:35,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 563 flow [2024-11-09 07:04:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-11-09 07:04:35,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2024-11-09 07:04:35,351 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 509 flow. Second operand 6 states and 616 transitions. [2024-11-09 07:04:35,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 563 flow [2024-11-09 07:04:35,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 155 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:35,355 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 531 flow [2024-11-09 07:04:35,356 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-11-09 07:04:35,356 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2024-11-09 07:04:35,356 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 531 flow [2024-11-09 07:04:35,357 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-11-09 07:04:35,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:35,357 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-11-09 07:04:35,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:04:35,357 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-11-09 07:04:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682072, now seen corresponding path program 1 times [2024-11-09 07:04:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059407950] [2024-11-09 07:04:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:35,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059407950] [2024-11-09 07:04:35,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059407950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:35,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:35,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400057933] [2024-11-09 07:04:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:35,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:35,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:35,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-11-09 07:04:35,681 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-11-09 07:04:35,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:35,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-11-09 07:04:35,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:36,407 INFO L124 PetriNetUnfolderBase]: 2425/6842 cut-off events. [2024-11-09 07:04:36,407 INFO L125 PetriNetUnfolderBase]: For 1864/2249 co-relation queries the response was YES. [2024-11-09 07:04:36,423 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-11-09 07:04:36,448 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2024-11-09 07:04:36,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 1359 flow [2024-11-09 07:04:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2024-11-09 07:04:36,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874643874643875 [2024-11-09 07:04:36,450 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 531 flow. Second operand 6 states and 623 transitions. [2024-11-09 07:04:36,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 1359 flow [2024-11-09 07:04:36,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 07:04:36,461 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2024-11-09 07:04:36,462 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-11-09 07:04:36,462 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2024-11-09 07:04:36,462 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2024-11-09 07:04:36,463 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-11-09 07:04:36,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:36,463 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-11-09 07:04:36,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:04:36,463 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-11-09 07:04:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1833776535, now seen corresponding path program 1 times [2024-11-09 07:04:36,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:36,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028951477] [2024-11-09 07:04:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:04:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028951477] [2024-11-09 07:04:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028951477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582634253] [2024-11-09 07:04:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:36,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:36,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:36,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2024-11-09 07:04:36,789 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-11-09 07:04:36,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:36,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2024-11-09 07:04:36,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:37,729 INFO L124 PetriNetUnfolderBase]: 3064/8860 cut-off events. [2024-11-09 07:04:37,729 INFO L125 PetriNetUnfolderBase]: For 6913/7212 co-relation queries the response was YES. [2024-11-09 07:04:37,751 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-11-09 07:04:37,787 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2024-11-09 07:04:37,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2024-11-09 07:04:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2024-11-09 07:04:37,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8319088319088319 [2024-11-09 07:04:37,789 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2024-11-09 07:04:37,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2024-11-09 07:04:37,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:37,819 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2024-11-09 07:04:37,820 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-11-09 07:04:37,820 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2024-11-09 07:04:37,820 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2024-11-09 07:04:37,821 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-11-09 07:04:37,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:37,821 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-11-09 07:04:37,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:04:37,821 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-11-09 07:04:37,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2096755450, now seen corresponding path program 1 times [2024-11-09 07:04:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142243957] [2024-11-09 07:04:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:04:38,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142243957] [2024-11-09 07:04:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142243957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:04:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16039940] [2024-11-09 07:04:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:38,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:04:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:04:38,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:04:38,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:04:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:38,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:04:38,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:04:38,368 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-11-09 07:04:38,410 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:04:38,411 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-11-09 07:04:38,455 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-11-09 07:04:38,464 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-11-09 07:04:38,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:04:38,480 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-11-09 07:04:38,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:04:38,498 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-11-09 07:04:38,634 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-11-09 07:04:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:04:38,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:04:38,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-09 07:04:38,814 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-11-09 07:04:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 6 trivial. 1 not checked. [2024-11-09 07:04:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16039940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:04:42,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:04:42,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2024-11-09 07:04:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309069320] [2024-11-09 07:04:42,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:04:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:04:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:04:42,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=135, Unknown=10, NotChecked=50, Total=240 [2024-11-09 07:04:42,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 117 [2024-11-09 07:04:42,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 16 states, 16 states have (on average 64.375) internal successors, (1030), 16 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:04:42,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:42,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 117 [2024-11-09 07:04:42,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:45,005 INFO L124 PetriNetUnfolderBase]: 8331/18747 cut-off events. [2024-11-09 07:04:45,006 INFO L125 PetriNetUnfolderBase]: For 23371/23374 co-relation queries the response was YES. [2024-11-09 07:04:45,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58253 conditions, 18747 events. 8331/18747 cut-off events. For 23371/23374 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 185034 event pairs, 2465 based on Foata normal form. 172/17959 useless extension candidates. Maximal degree in co-relation 56297. Up to 8285 conditions per place. [2024-11-09 07:04:45,143 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 389 selfloop transitions, 36 changer transitions 0/490 dead transitions. [2024-11-09 07:04:45,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 490 transitions, 4293 flow [2024-11-09 07:04:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:04:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 07:04:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 942 transitions. [2024-11-09 07:04:45,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193293885601578 [2024-11-09 07:04:45,146 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 942 transitions. [2024-11-09 07:04:45,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 490 transitions, 4293 flow [2024-11-09 07:04:45,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 490 transitions, 4153 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:45,218 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2024-11-09 07:04:45,218 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-11-09 07:04:45,218 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2024-11-09 07:04:45,218 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2024-11-09 07:04:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 64.375) internal successors, (1030), 16 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:04:45,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:45,219 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-11-09 07:04:45,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:04:45,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 07:04:45,421 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-11-09 07:04:45,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -369940300, now seen corresponding path program 1 times [2024-11-09 07:04:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828381075] [2024-11-09 07:04:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:04:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828381075] [2024-11-09 07:04:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828381075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:45,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:04:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991493868] [2024-11-09 07:04:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:45,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:04:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:04:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:04:46,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-11-09 07:04:46,350 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-11-09 07:04:46,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:46,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-11-09 07:04:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:48,002 INFO L124 PetriNetUnfolderBase]: 5095/13018 cut-off events. [2024-11-09 07:04:48,003 INFO L125 PetriNetUnfolderBase]: For 18405/20352 co-relation queries the response was YES. [2024-11-09 07:04:48,035 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 128935 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-11-09 07:04:48,077 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2024-11-09 07:04:48,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2024-11-09 07:04:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:04:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-09 07:04:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2024-11-09 07:04:48,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2024-11-09 07:04:48,080 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2024-11-09 07:04:48,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2024-11-09 07:04:48,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-09 07:04:48,261 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2024-11-09 07:04:48,263 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-11-09 07:04:48,264 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2024-11-09 07:04:48,264 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2024-11-09 07:04:48,264 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-11-09 07:04:48,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:48,264 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:48,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:04:48,265 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-11-09 07:04:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1121471070, now seen corresponding path program 1 times [2024-11-09 07:04:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818947089] [2024-11-09 07:04:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:04:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818947089] [2024-11-09 07:04:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818947089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:04:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705978499] [2024-11-09 07:04:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:04:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:04:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:04:48,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-11-09 07:04:48,896 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-11-09 07:04:48,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:48,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-11-09 07:04:48,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:50,811 INFO L124 PetriNetUnfolderBase]: 4491/12035 cut-off events. [2024-11-09 07:04:50,811 INFO L125 PetriNetUnfolderBase]: For 34324/34927 co-relation queries the response was YES. [2024-11-09 07:04:50,931 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 121136 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-11-09 07:04:50,969 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2024-11-09 07:04:50,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2024-11-09 07:04:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:04:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 07:04:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2024-11-09 07:04:50,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7218934911242604 [2024-11-09 07:04:50,974 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2024-11-09 07:04:50,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2024-11-09 07:04:51,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-11-09 07:04:51,111 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2024-11-09 07:04:51,112 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-11-09 07:04:51,112 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2024-11-09 07:04:51,112 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2024-11-09 07:04:51,113 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-11-09 07:04:51,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:51,113 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-11-09 07:04:51,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:04:51,113 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-11-09 07:04:51,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1249667111, now seen corresponding path program 1 times [2024-11-09 07:04:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:51,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528443104] [2024-11-09 07:04:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 07:04:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528443104] [2024-11-09 07:04:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528443104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:51,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059175054] [2024-11-09 07:04:51,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:51,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:51,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:51,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-11-09 07:04:51,372 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-11-09 07:04:51,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:51,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-11-09 07:04:51,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:52,191 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-11-09 07:04:52,193 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-11-09 07:04:52,193 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 07:04:52,193 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 07:04:52,193 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 07:04:54,324 INFO L124 PetriNetUnfolderBase]: 9630/21884 cut-off events. [2024-11-09 07:04:54,324 INFO L125 PetriNetUnfolderBase]: For 73818/75081 co-relation queries the response was YES. [2024-11-09 07:04:54,410 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 223543 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-11-09 07:04:54,633 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2024-11-09 07:04:54,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2024-11-09 07:04:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2024-11-09 07:04:54,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8817663817663818 [2024-11-09 07:04:54,635 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2024-11-09 07:04:54,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2024-11-09 07:04:54,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-09 07:04:55,001 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2024-11-09 07:04:55,001 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-11-09 07:04:55,002 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2024-11-09 07:04:55,002 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2024-11-09 07:04:55,002 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-11-09 07:04:55,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:55,002 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-11-09 07:04:55,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:04:55,003 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-11-09 07:04:55,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103095, now seen corresponding path program 1 times [2024-11-09 07:04:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:55,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734512131] [2024-11-09 07:04:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:04:55,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:04:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:04:55,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:04:55,037 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:04:55,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-09 07:04:55,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-09 07:04:55,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-09 07:04:55,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-09 07:04:55,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:04:55,039 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:55,040 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 07:04:55,040 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 07:04:55,056 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 07:04:55,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 303 flow [2024-11-09 07:04:55,084 INFO L124 PetriNetUnfolderBase]: 21/368 cut-off events. [2024-11-09 07:04:55,084 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-11-09 07:04:55,085 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-11-09 07:04:55,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 138 transitions, 303 flow [2024-11-09 07:04:55,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 303 flow [2024-11-09 07:04:55,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:04:55,089 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fa07db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:04:55,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 07:04:55,091 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:04:55,091 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-09 07:04:55,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:04:55,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:55,092 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:55,092 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-11-09 07:04:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1113706995, now seen corresponding path program 1 times [2024-11-09 07:04:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109908579] [2024-11-09 07:04:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:55,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109908579] [2024-11-09 07:04:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109908579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424560746] [2024-11-09 07:04:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:55,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:55,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:55,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-09 07:04:55,137 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-11-09 07:04:55,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:55,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-09 07:04:55,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:55,247 INFO L124 PetriNetUnfolderBase]: 90/1260 cut-off events. [2024-11-09 07:04:55,247 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-09 07:04:55,252 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-11-09 07:04:55,255 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2024-11-09 07:04:55,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2024-11-09 07:04:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-09 07:04:55,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2024-11-09 07:04:55,257 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 303 flow. Second operand 3 states and 374 transitions. [2024-11-09 07:04:55,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2024-11-09 07:04:55,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:55,259 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2024-11-09 07:04:55,259 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-11-09 07:04:55,259 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2024-11-09 07:04:55,259 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2024-11-09 07:04:55,260 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-11-09 07:04:55,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:55,260 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:55,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:04:55,260 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-11-09 07:04:55,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1671261316, now seen corresponding path program 1 times [2024-11-09 07:04:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:55,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713446162] [2024-11-09 07:04:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:55,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713446162] [2024-11-09 07:04:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713446162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011214657] [2024-11-09 07:04:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:55,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-11-09 07:04:55,294 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-11-09 07:04:55,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:55,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-11-09 07:04:55,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:55,502 INFO L124 PetriNetUnfolderBase]: 307/2452 cut-off events. [2024-11-09 07:04:55,502 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2024-11-09 07:04:55,509 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-11-09 07:04:55,514 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-11-09 07:04:55,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2024-11-09 07:04:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-09 07:04:55,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-11-09 07:04:55,515 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2024-11-09 07:04:55,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2024-11-09 07:04:55,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:04:55,517 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2024-11-09 07:04:55,517 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-11-09 07:04:55,518 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2024-11-09 07:04:55,518 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2024-11-09 07:04:55,518 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-11-09 07:04:55,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:55,518 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-11-09 07:04:55,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:04:55,518 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-11-09 07:04:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1076870248, now seen corresponding path program 1 times [2024-11-09 07:04:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384666384] [2024-11-09 07:04:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384666384] [2024-11-09 07:04:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384666384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:55,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843254017] [2024-11-09 07:04:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:55,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:55,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:55,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:55,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 138 [2024-11-09 07:04:55,831 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-11-09 07:04:55,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:55,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 138 [2024-11-09 07:04:55,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:57,837 INFO L124 PetriNetUnfolderBase]: 10379/23786 cut-off events. [2024-11-09 07:04:57,838 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2024-11-09 07:04:57,879 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-11-09 07:04:57,942 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 37 selfloop transitions, 54 changer transitions 0/188 dead transitions. [2024-11-09 07:04:57,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 617 flow [2024-11-09 07:04:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2024-11-09 07:04:57,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2024-11-09 07:04:57,944 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 686 transitions. [2024-11-09 07:04:57,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 617 flow [2024-11-09 07:04:57,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 188 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:57,948 INFO L231 Difference]: Finished difference. Result has 146 places, 186 transitions, 671 flow [2024-11-09 07:04:57,948 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-11-09 07:04:57,949 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2024-11-09 07:04:57,949 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 186 transitions, 671 flow [2024-11-09 07:04:57,949 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-11-09 07:04:57,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:57,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:04:57,950 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-11-09 07:04:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1210831814, now seen corresponding path program 1 times [2024-11-09 07:04:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:57,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666333457] [2024-11-09 07:04:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:57,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666333457] [2024-11-09 07:04:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666333457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559156215] [2024-11-09 07:04:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:57,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:04:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:04:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:04:58,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-09 07:04:58,052 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-11-09 07:04:58,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:58,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-09 07:04:58,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:59,209 INFO L124 PetriNetUnfolderBase]: 4742/12157 cut-off events. [2024-11-09 07:04:59,210 INFO L125 PetriNetUnfolderBase]: For 3135/3635 co-relation queries the response was YES. [2024-11-09 07:04:59,249 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-11-09 07:04:59,285 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 16 selfloop transitions, 2 changer transitions 5/192 dead transitions. [2024-11-09 07:04:59,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 192 transitions, 729 flow [2024-11-09 07:04:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:04:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:04:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2024-11-09 07:04:59,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-09 07:04:59,287 INFO L175 Difference]: Start difference. First operand has 146 places, 186 transitions, 671 flow. Second operand 6 states and 732 transitions. [2024-11-09 07:04:59,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 192 transitions, 729 flow [2024-11-09 07:04:59,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 192 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:04:59,308 INFO L231 Difference]: Finished difference. Result has 155 places, 187 transitions, 693 flow [2024-11-09 07:04:59,308 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-11-09 07:04:59,308 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 16 predicate places. [2024-11-09 07:04:59,309 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 187 transitions, 693 flow [2024-11-09 07:04:59,309 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-11-09 07:04:59,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:59,309 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-11-09 07:04:59,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:04:59,309 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-11-09 07:04:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1389642421, now seen corresponding path program 1 times [2024-11-09 07:04:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:59,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699738074] [2024-11-09 07:04:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:04:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699738074] [2024-11-09 07:04:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699738074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:59,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:04:59,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417385530] [2024-11-09 07:04:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:59,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:04:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:04:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:04:59,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 138 [2024-11-09 07:04:59,589 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-11-09 07:04:59,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:59,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 138 [2024-11-09 07:04:59,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:02,672 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-11-09 07:05:02,672 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-09 07:05:02,672 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 07:05:02,672 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 07:05:02,672 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-09 07:05:02,931 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-11-09 07:05:02,931 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-11-09 07:05:02,931 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-09 07:05:02,932 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-09 07:05:02,932 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-09 07:05:03,273 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-11-09 07:05:03,273 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-11-09 07:05:03,273 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-09 07:05:03,273 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-09 07:05:03,273 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-09 07:05:03,408 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-11-09 07:05:03,408 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-11-09 07:05:03,408 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-09 07:05:03,408 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-09 07:05:03,408 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-09 07:05:06,090 INFO L124 PetriNetUnfolderBase]: 29047/67038 cut-off events. [2024-11-09 07:05:06,090 INFO L125 PetriNetUnfolderBase]: For 19554/23332 co-relation queries the response was YES. [2024-11-09 07:05:06,336 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-11-09 07:05:06,636 INFO L140 encePairwiseOnDemand]: 115/138 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2024-11-09 07:05:06,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 349 transitions, 1957 flow [2024-11-09 07:05:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2024-11-09 07:05:06,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973429951690821 [2024-11-09 07:05:06,638 INFO L175 Difference]: Start difference. First operand has 155 places, 187 transitions, 693 flow. Second operand 6 states and 743 transitions. [2024-11-09 07:05:06,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 349 transitions, 1957 flow [2024-11-09 07:05:06,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 07:05:06,755 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2024-11-09 07:05:06,756 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-11-09 07:05:06,756 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2024-11-09 07:05:06,756 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2024-11-09 07:05:06,756 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-11-09 07:05:06,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:06,756 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-11-09 07:05:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:05:06,757 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-11-09 07:05:06,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1362260044, now seen corresponding path program 1 times [2024-11-09 07:05:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62926763] [2024-11-09 07:05:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:05:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62926763] [2024-11-09 07:05:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62926763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:07,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112428210] [2024-11-09 07:05:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:07,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:07,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:07,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 138 [2024-11-09 07:05:07,156 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-11-09 07:05:07,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:07,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 138 [2024-11-09 07:05:07,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:16,212 INFO L124 PetriNetUnfolderBase]: 35337/82836 cut-off events. [2024-11-09 07:05:16,212 INFO L125 PetriNetUnfolderBase]: For 74578/77386 co-relation queries the response was YES. [2024-11-09 07:05:16,541 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-11-09 07:05:16,869 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2024-11-09 07:05:16,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2024-11-09 07:05:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2024-11-09 07:05:16,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417874396135265 [2024-11-09 07:05:16,871 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2024-11-09 07:05:16,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2024-11-09 07:05:17,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:17,401 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2024-11-09 07:05:17,401 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-11-09 07:05:17,401 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2024-11-09 07:05:17,401 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2024-11-09 07:05:17,402 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-11-09 07:05:17,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:17,402 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-11-09 07:05:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:05:17,402 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-11-09 07:05:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1695343455, now seen corresponding path program 1 times [2024-11-09 07:05:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971337091] [2024-11-09 07:05:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:05:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971337091] [2024-11-09 07:05:17,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971337091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:17,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86314991] [2024-11-09 07:05:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:17,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:17,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:17,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:05:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:17,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:05:17,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:17,959 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-11-09 07:05:17,973 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:05:17,974 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-11-09 07:05:18,008 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-11-09 07:05:18,016 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-11-09 07:05:18,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:18,027 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-11-09 07:05:18,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:18,039 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-11-09 07:05:18,125 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-11-09 07:05:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:05:18,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:18,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-09 07:05:18,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-09 07:05:18,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-09 07:05:18,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-09 07:05:18,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:18,282 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 51 treesize of output 67 [2024-11-09 07:05:18,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:18,288 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 115 treesize of output 35 [2024-11-09 07:05:18,294 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:18,294 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-11-09 07:05:18,298 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:18,298 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-11-09 07:05:18,302 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:18,302 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 50 treesize of output 1 [2024-11-09 07:05:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2024-11-09 07:05:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86314991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:18,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-09 07:05:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712038651] [2024-11-09 07:05:18,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:05:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:05:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=124, Unknown=4, NotChecked=100, Total=272 [2024-11-09 07:05:18,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 138 [2024-11-09 07:05:18,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 409 transitions, 2981 flow. Second operand has 17 states, 17 states have (on average 76.29411764705883) internal successors, (1297), 17 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:05:18,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:18,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 138 [2024-11-09 07:05:18,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand