./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:16,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:16,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:16,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:16,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:16,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:16,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:16,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:16,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:16,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:16,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:16,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:16,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:16,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:16,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:16,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:16,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:16,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:16,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:16,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:16,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:16,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:16,694 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:16,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:16,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:16,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:16,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:16,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:16,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:16,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:16,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:16,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:16,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:16,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:16,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:16,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:16,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:16,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:16,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:16,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:16,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:16,711 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 -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2024-10-13 09:57:16,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:17,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:17,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:17,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:17,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:17,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2024-10-13 09:57:18,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:18,735 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:18,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2024-10-13 09:57:18,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f0ab8ce/f15aae096e794b41b610e73b37aa4bd5/FLAG7e3ca8c56 [2024-10-13 09:57:18,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f0ab8ce/f15aae096e794b41b610e73b37aa4bd5 [2024-10-13 09:57:18,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:18,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:18,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:18,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:18,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:18,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:18" (1/1) ... [2024-10-13 09:57:18,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba44494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:18, skipping insertion in model container [2024-10-13 09:57:18,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:18" (1/1) ... [2024-10-13 09:57:18,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:18,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:19,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:19,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:19,059 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:19,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19 WrapperNode [2024-10-13 09:57:19,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:19,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:19,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:19,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:19,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,115 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 323 [2024-10-13 09:57:19,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:19,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:19,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:19,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:19,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:19,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:19,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:19,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:19,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (1/1) ... [2024-10-13 09:57:19,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:19,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:57:19,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:57:19,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:19,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:19,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:19,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:57:19,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:57:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:19,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:19,287 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:19,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:19,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:20,128 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:20,129 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:20,171 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:20,173 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 09:57:20,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:20 BoogieIcfgContainer [2024-10-13 09:57:20,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:20,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:20,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:20,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:20,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:18" (1/3) ... [2024-10-13 09:57:20,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a28b727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:20, skipping insertion in model container [2024-10-13 09:57:20,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:19" (2/3) ... [2024-10-13 09:57:20,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a28b727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:20, skipping insertion in model container [2024-10-13 09:57:20,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:20" (3/3) ... [2024-10-13 09:57:20,186 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2024-10-13 09:57:20,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:20,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-13 09:57:20,205 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:20,335 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:57:20,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 454 transitions, 929 flow [2024-10-13 09:57:20,539 INFO L124 PetriNetUnfolderBase]: 18/451 cut-off events. [2024-10-13 09:57:20,539 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:20,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 451 events. 18/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 777 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2024-10-13 09:57:20,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 454 transitions, 929 flow [2024-10-13 09:57:20,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 431 transitions, 880 flow [2024-10-13 09:57:20,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:20,597 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;@5e2a4504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:20,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-13 09:57:20,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:20,608 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-13 09:57:20,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:20,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:20,609 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] [2024-10-13 09:57:20,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1481465963, now seen corresponding path program 1 times [2024-10-13 09:57:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248430419] [2024-10-13 09:57:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248430419] [2024-10-13 09:57:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248430419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805158566] [2024-10-13 09:57:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:20,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:20,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:20,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2024-10-13 09:57:20,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 431 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:20,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:20,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2024-10-13 09:57:20,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:21,458 INFO L124 PetriNetUnfolderBase]: 33/1375 cut-off events. [2024-10-13 09:57:21,458 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2024-10-13 09:57:21,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1375 events. 33/1375 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6213 event pairs, 20 based on Foata normal form. 76/1250 useless extension candidates. Maximal degree in co-relation 1300. Up to 50 conditions per place. [2024-10-13 09:57:21,478 INFO L140 encePairwiseOnDemand]: 438/454 looper letters, 13 selfloop transitions, 2 changer transitions 1/417 dead transitions. [2024-10-13 09:57:21,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 417 transitions, 882 flow [2024-10-13 09:57:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:21,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:21,505 INFO L175 Difference]: Start difference. First operand has 425 places, 431 transitions, 880 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:21,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 417 transitions, 882 flow [2024-10-13 09:57:21,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 870 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:57:21,521 INFO L231 Difference]: Finished difference. Result has 420 places, 416 transitions, 842 flow [2024-10-13 09:57:21,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=420, PETRI_TRANSITIONS=416} [2024-10-13 09:57:21,527 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -5 predicate places. [2024-10-13 09:57:21,530 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 416 transitions, 842 flow [2024-10-13 09:57:21,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:21,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:21,531 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] [2024-10-13 09:57:21,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:21,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:21,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -666654298, now seen corresponding path program 1 times [2024-10-13 09:57:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758121101] [2024-10-13 09:57:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758121101] [2024-10-13 09:57:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758121101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:21,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043061809] [2024-10-13 09:57:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:21,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:21,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-10-13 09:57:21,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 416 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:21,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:21,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-10-13 09:57:21,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:21,840 INFO L124 PetriNetUnfolderBase]: 16/956 cut-off events. [2024-10-13 09:57:21,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:21,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 956 events. 16/956 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4028 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 957. Up to 25 conditions per place. [2024-10-13 09:57:21,862 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-10-13 09:57:21,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 415 transitions, 866 flow [2024-10-13 09:57:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-13 09:57:21,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-10-13 09:57:21,866 INFO L175 Difference]: Start difference. First operand has 420 places, 416 transitions, 842 flow. Second operand 3 states and 1286 transitions. [2024-10-13 09:57:21,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 415 transitions, 866 flow [2024-10-13 09:57:21,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:21,874 INFO L231 Difference]: Finished difference. Result has 418 places, 415 transitions, 840 flow [2024-10-13 09:57:21,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=418, PETRI_TRANSITIONS=415} [2024-10-13 09:57:21,876 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -7 predicate places. [2024-10-13 09:57:21,876 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 415 transitions, 840 flow [2024-10-13 09:57:21,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:21,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:21,878 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] [2024-10-13 09:57:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:21,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:21,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2102967575, now seen corresponding path program 1 times [2024-10-13 09:57:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515121274] [2024-10-13 09:57:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515121274] [2024-10-13 09:57:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515121274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818143559] [2024-10-13 09:57:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:21,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-10-13 09:57:22,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 415 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-10-13 09:57:22,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:22,186 INFO L124 PetriNetUnfolderBase]: 16/937 cut-off events. [2024-10-13 09:57:22,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:22,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 937 events. 16/937 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3931 event pairs, 7 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 930. Up to 25 conditions per place. [2024-10-13 09:57:22,208 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2024-10-13 09:57:22,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 414 transitions, 864 flow [2024-10-13 09:57:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-13 09:57:22,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-10-13 09:57:22,213 INFO L175 Difference]: Start difference. First operand has 418 places, 415 transitions, 840 flow. Second operand 3 states and 1286 transitions. [2024-10-13 09:57:22,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 414 transitions, 864 flow [2024-10-13 09:57:22,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 414 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:22,220 INFO L231 Difference]: Finished difference. Result has 417 places, 414 transitions, 838 flow [2024-10-13 09:57:22,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=417, PETRI_TRANSITIONS=414} [2024-10-13 09:57:22,223 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -8 predicate places. [2024-10-13 09:57:22,223 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 414 transitions, 838 flow [2024-10-13 09:57:22,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:22,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:22,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:22,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:22,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1511710481, now seen corresponding path program 1 times [2024-10-13 09:57:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371562648] [2024-10-13 09:57:22,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371562648] [2024-10-13 09:57:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371562648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034379464] [2024-10-13 09:57:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:22,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2024-10-13 09:57:22,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2024-10-13 09:57:22,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:22,502 INFO L124 PetriNetUnfolderBase]: 19/807 cut-off events. [2024-10-13 09:57:22,502 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-10-13 09:57:22,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 19/807 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2820 event pairs, 12 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 805. Up to 38 conditions per place. [2024-10-13 09:57:22,517 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-10-13 09:57:22,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 413 transitions, 866 flow [2024-10-13 09:57:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-10-13 09:57:22,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2024-10-13 09:57:22,521 INFO L175 Difference]: Start difference. First operand has 417 places, 414 transitions, 838 flow. Second operand 3 states and 1282 transitions. [2024-10-13 09:57:22,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 413 transitions, 866 flow [2024-10-13 09:57:22,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 413 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:22,529 INFO L231 Difference]: Finished difference. Result has 416 places, 413 transitions, 836 flow [2024-10-13 09:57:22,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=416, PETRI_TRANSITIONS=413} [2024-10-13 09:57:22,531 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -9 predicate places. [2024-10-13 09:57:22,532 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 413 transitions, 836 flow [2024-10-13 09:57:22,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:22,534 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] [2024-10-13 09:57:22,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:22,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:22,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 805669637, now seen corresponding path program 1 times [2024-10-13 09:57:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662676277] [2024-10-13 09:57:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662676277] [2024-10-13 09:57:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662676277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879611076] [2024-10-13 09:57:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-10-13 09:57:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-10-13 09:57:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:22,785 INFO L124 PetriNetUnfolderBase]: 12/784 cut-off events. [2024-10-13 09:57:22,786 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-10-13 09:57:22,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 784 events. 12/784 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2122 event pairs, 5 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2024-10-13 09:57:22,803 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2024-10-13 09:57:22,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 860 flow [2024-10-13 09:57:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-13 09:57:22,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-10-13 09:57:22,809 INFO L175 Difference]: Start difference. First operand has 416 places, 413 transitions, 836 flow. Second operand 3 states and 1286 transitions. [2024-10-13 09:57:22,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 860 flow [2024-10-13 09:57:22,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 412 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:22,820 INFO L231 Difference]: Finished difference. Result has 415 places, 412 transitions, 834 flow [2024-10-13 09:57:22,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=415, PETRI_TRANSITIONS=412} [2024-10-13 09:57:22,824 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2024-10-13 09:57:22,825 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 412 transitions, 834 flow [2024-10-13 09:57:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:22,827 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:22,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:22,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1067874234, now seen corresponding path program 1 times [2024-10-13 09:57:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893029406] [2024-10-13 09:57:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893029406] [2024-10-13 09:57:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893029406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:22,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227091949] [2024-10-13 09:57:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:22,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:22,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:22,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-10-13 09:57:22,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:22,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-10-13 09:57:22,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,101 INFO L124 PetriNetUnfolderBase]: 12/777 cut-off events. [2024-10-13 09:57:23,102 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-10-13 09:57:23,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 777 events. 12/777 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2081 event pairs, 5 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 741. Up to 22 conditions per place. [2024-10-13 09:57:23,117 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2024-10-13 09:57:23,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 411 transitions, 858 flow [2024-10-13 09:57:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-13 09:57:23,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-10-13 09:57:23,121 INFO L175 Difference]: Start difference. First operand has 415 places, 412 transitions, 834 flow. Second operand 3 states and 1286 transitions. [2024-10-13 09:57:23,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 411 transitions, 858 flow [2024-10-13 09:57:23,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 411 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,130 INFO L231 Difference]: Finished difference. Result has 414 places, 411 transitions, 832 flow [2024-10-13 09:57:23,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=414, PETRI_TRANSITIONS=411} [2024-10-13 09:57:23,132 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2024-10-13 09:57:23,132 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 411 transitions, 832 flow [2024-10-13 09:57:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:23,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:23,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:23,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1914240621, now seen corresponding path program 1 times [2024-10-13 09:57:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068195744] [2024-10-13 09:57:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068195744] [2024-10-13 09:57:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068195744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496467305] [2024-10-13 09:57:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2024-10-13 09:57:23,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2024-10-13 09:57:23,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,351 INFO L124 PetriNetUnfolderBase]: 25/626 cut-off events. [2024-10-13 09:57:23,352 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-10-13 09:57:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 626 events. 25/626 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2198 event pairs, 20 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 610. Up to 50 conditions per place. [2024-10-13 09:57:23,366 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:23,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 410 transitions, 860 flow [2024-10-13 09:57:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-10-13 09:57:23,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2024-10-13 09:57:23,369 INFO L175 Difference]: Start difference. First operand has 414 places, 411 transitions, 832 flow. Second operand 3 states and 1282 transitions. [2024-10-13 09:57:23,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 410 transitions, 860 flow [2024-10-13 09:57:23,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,377 INFO L231 Difference]: Finished difference. Result has 413 places, 410 transitions, 830 flow [2024-10-13 09:57:23,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=413, PETRI_TRANSITIONS=410} [2024-10-13 09:57:23,378 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-10-13 09:57:23,378 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 410 transitions, 830 flow [2024-10-13 09:57:23,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:23,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:23,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:23,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1935635487, now seen corresponding path program 1 times [2024-10-13 09:57:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261157124] [2024-10-13 09:57:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:23,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261157124] [2024-10-13 09:57:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261157124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603046609] [2024-10-13 09:57:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-10-13 09:57:23,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-10-13 09:57:23,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,580 INFO L124 PetriNetUnfolderBase]: 14/681 cut-off events. [2024-10-13 09:57:23,580 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-10-13 09:57:23,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 681 events. 14/681 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1754 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 631. Up to 25 conditions per place. [2024-10-13 09:57:23,591 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2024-10-13 09:57:23,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 854 flow [2024-10-13 09:57:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-13 09:57:23,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-10-13 09:57:23,594 INFO L175 Difference]: Start difference. First operand has 413 places, 410 transitions, 830 flow. Second operand 3 states and 1286 transitions. [2024-10-13 09:57:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 854 flow [2024-10-13 09:57:23,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 409 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,602 INFO L231 Difference]: Finished difference. Result has 412 places, 409 transitions, 828 flow [2024-10-13 09:57:23,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=412, PETRI_TRANSITIONS=409} [2024-10-13 09:57:23,603 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-10-13 09:57:23,603 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 409 transitions, 828 flow [2024-10-13 09:57:23,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,604 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:23,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:23,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1967425806, now seen corresponding path program 1 times [2024-10-13 09:57:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83848292] [2024-10-13 09:57:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83848292] [2024-10-13 09:57:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83848292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476052716] [2024-10-13 09:57:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-10-13 09:57:23,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-10-13 09:57:23,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,794 INFO L124 PetriNetUnfolderBase]: 14/671 cut-off events. [2024-10-13 09:57:23,794 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-10-13 09:57:23,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 671 events. 14/671 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1727 event pairs, 7 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 613. Up to 25 conditions per place. [2024-10-13 09:57:23,806 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-10-13 09:57:23,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 852 flow [2024-10-13 09:57:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-10-13 09:57:23,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-10-13 09:57:23,811 INFO L175 Difference]: Start difference. First operand has 412 places, 409 transitions, 828 flow. Second operand 3 states and 1286 transitions. [2024-10-13 09:57:23,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 852 flow [2024-10-13 09:57:23,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 408 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,818 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 826 flow [2024-10-13 09:57:23,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2024-10-13 09:57:23,820 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2024-10-13 09:57:23,820 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 826 flow [2024-10-13 09:57:23,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,821 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:23,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:57:23,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash -224796327, now seen corresponding path program 1 times [2024-10-13 09:57:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807031012] [2024-10-13 09:57:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807031012] [2024-10-13 09:57:23,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807031012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120640206] [2024-10-13 09:57:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:23,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:23,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:23,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,088 INFO L124 PetriNetUnfolderBase]: 34/1406 cut-off events. [2024-10-13 09:57:24,088 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:24,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1406 events. 34/1406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8143 event pairs, 13 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1370. Up to 43 conditions per place. [2024-10-13 09:57:24,111 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:24,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 862 flow [2024-10-13 09:57:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:24,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:24,115 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 826 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:24,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 862 flow [2024-10-13 09:57:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,123 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 832 flow [2024-10-13 09:57:24,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2024-10-13 09:57:24,125 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2024-10-13 09:57:24,125 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 832 flow [2024-10-13 09:57:24,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:24,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:24,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:57:24,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:24,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1280872901, now seen corresponding path program 1 times [2024-10-13 09:57:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948332233] [2024-10-13 09:57:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948332233] [2024-10-13 09:57:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948332233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680859371] [2024-10-13 09:57:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:24,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:24,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,489 INFO L124 PetriNetUnfolderBase]: 40/1646 cut-off events. [2024-10-13 09:57:24,489 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:24,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 1646 events. 40/1646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10640 event pairs, 14 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1337. Up to 49 conditions per place. [2024-10-13 09:57:24,504 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:24,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 868 flow [2024-10-13 09:57:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:24,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:24,508 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 832 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:24,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 868 flow [2024-10-13 09:57:24,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 410 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:24,515 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 842 flow [2024-10-13 09:57:24,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2024-10-13 09:57:24,516 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2024-10-13 09:57:24,516 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 842 flow [2024-10-13 09:57:24,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:24,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,517 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:57:24,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -137455449, now seen corresponding path program 1 times [2024-10-13 09:57:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012602413] [2024-10-13 09:57:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012602413] [2024-10-13 09:57:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012602413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814006930] [2024-10-13 09:57:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:24,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:24,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:24,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,741 INFO L124 PetriNetUnfolderBase]: 24/902 cut-off events. [2024-10-13 09:57:24,742 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:24,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 902 events. 24/902 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4377 event pairs, 4 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 759. Up to 31 conditions per place. [2024-10-13 09:57:24,767 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:24,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 878 flow [2024-10-13 09:57:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:24,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:24,771 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 842 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:24,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 878 flow [2024-10-13 09:57:24,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 410 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:24,779 INFO L231 Difference]: Finished difference. Result has 412 places, 408 transitions, 852 flow [2024-10-13 09:57:24,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=408} [2024-10-13 09:57:24,781 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-10-13 09:57:24,781 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 408 transitions, 852 flow [2024-10-13 09:57:24,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:24,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:24,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:57:24,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:24,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1049338249, now seen corresponding path program 1 times [2024-10-13 09:57:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779876787] [2024-10-13 09:57:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779876787] [2024-10-13 09:57:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779876787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545711170] [2024-10-13 09:57:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:24,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 408 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:24,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:24,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,040 INFO L124 PetriNetUnfolderBase]: 26/943 cut-off events. [2024-10-13 09:57:25,041 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:25,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 943 events. 26/943 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4688 event pairs, 4 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 810. Up to 35 conditions per place. [2024-10-13 09:57:25,059 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:25,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 410 transitions, 888 flow [2024-10-13 09:57:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:25,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:25,063 INFO L175 Difference]: Start difference. First operand has 412 places, 408 transitions, 852 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:25,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 410 transitions, 888 flow [2024-10-13 09:57:25,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 410 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,070 INFO L231 Difference]: Finished difference. Result has 413 places, 408 transitions, 862 flow [2024-10-13 09:57:25,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=413, PETRI_TRANSITIONS=408} [2024-10-13 09:57:25,071 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-10-13 09:57:25,072 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 408 transitions, 862 flow [2024-10-13 09:57:25,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:25,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,073 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:25,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:57:25,073 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:25,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash -200193379, now seen corresponding path program 1 times [2024-10-13 09:57:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742719904] [2024-10-13 09:57:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742719904] [2024-10-13 09:57:25,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742719904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847502498] [2024-10-13 09:57:25,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:25,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 408 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:25,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:25,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,530 INFO L124 PetriNetUnfolderBase]: 66/1778 cut-off events. [2024-10-13 09:57:25,531 INFO L125 PetriNetUnfolderBase]: For 21/25 co-relation queries the response was YES. [2024-10-13 09:57:25,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1778 events. 66/1778 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10935 event pairs, 10 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1461. Up to 80 conditions per place. [2024-10-13 09:57:25,553 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:25,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 898 flow [2024-10-13 09:57:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:25,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:25,557 INFO L175 Difference]: Start difference. First operand has 413 places, 408 transitions, 862 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:25,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 898 flow [2024-10-13 09:57:25,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,565 INFO L231 Difference]: Finished difference. Result has 414 places, 408 transitions, 872 flow [2024-10-13 09:57:25,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=414, PETRI_TRANSITIONS=408} [2024-10-13 09:57:25,567 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2024-10-13 09:57:25,567 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 408 transitions, 872 flow [2024-10-13 09:57:25,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:25,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:57:25,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:25,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 887727743, now seen corresponding path program 1 times [2024-10-13 09:57:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861694984] [2024-10-13 09:57:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861694984] [2024-10-13 09:57:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861694984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925445189] [2024-10-13 09:57:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:25,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 408 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:25,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:25,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,004 INFO L124 PetriNetUnfolderBase]: 75/1940 cut-off events. [2024-10-13 09:57:26,005 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-10-13 09:57:26,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1940 events. 75/1940 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12063 event pairs, 19 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 1659. Up to 90 conditions per place. [2024-10-13 09:57:26,040 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-10-13 09:57:26,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 410 transitions, 908 flow [2024-10-13 09:57:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:26,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:26,045 INFO L175 Difference]: Start difference. First operand has 414 places, 408 transitions, 872 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:26,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 410 transitions, 908 flow [2024-10-13 09:57:26,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,054 INFO L231 Difference]: Finished difference. Result has 415 places, 408 transitions, 882 flow [2024-10-13 09:57:26,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=415, PETRI_TRANSITIONS=408} [2024-10-13 09:57:26,057 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2024-10-13 09:57:26,057 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 408 transitions, 882 flow [2024-10-13 09:57:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:26,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:57:26,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:26,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -89474115, now seen corresponding path program 1 times [2024-10-13 09:57:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335180539] [2024-10-13 09:57:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335180539] [2024-10-13 09:57:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335180539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328449399] [2024-10-13 09:57:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2024-10-13 09:57:26,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 408 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:26,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2024-10-13 09:57:26,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,426 INFO L124 PetriNetUnfolderBase]: 163/1738 cut-off events. [2024-10-13 09:57:26,427 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-13 09:57:26,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1738 events. 163/1738 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12345 event pairs, 60 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 1724. Up to 239 conditions per place. [2024-10-13 09:57:26,459 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-10-13 09:57:26,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 922 flow [2024-10-13 09:57:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2024-10-13 09:57:26,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2024-10-13 09:57:26,463 INFO L175 Difference]: Start difference. First operand has 415 places, 408 transitions, 882 flow. Second operand 3 states and 1283 transitions. [2024-10-13 09:57:26,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 922 flow [2024-10-13 09:57:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,470 INFO L231 Difference]: Finished difference. Result has 414 places, 406 transitions, 888 flow [2024-10-13 09:57:26,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=414, PETRI_TRANSITIONS=406} [2024-10-13 09:57:26,471 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2024-10-13 09:57:26,471 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 406 transitions, 888 flow [2024-10-13 09:57:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:26,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:57:26,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash -85243873, now seen corresponding path program 1 times [2024-10-13 09:57:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553198414] [2024-10-13 09:57:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553198414] [2024-10-13 09:57:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553198414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059761653] [2024-10-13 09:57:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2024-10-13 09:57:26,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 406 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:26,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2024-10-13 09:57:26,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,803 INFO L124 PetriNetUnfolderBase]: 121/1554 cut-off events. [2024-10-13 09:57:26,803 INFO L125 PetriNetUnfolderBase]: For 21/45 co-relation queries the response was YES. [2024-10-13 09:57:26,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1554 events. 121/1554 cut-off events. For 21/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9833 event pairs, 52 based on Foata normal form. 3/1362 useless extension candidates. Maximal degree in co-relation 1555. Up to 191 conditions per place. [2024-10-13 09:57:26,829 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2024-10-13 09:57:26,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 406 transitions, 928 flow [2024-10-13 09:57:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2024-10-13 09:57:26,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2024-10-13 09:57:26,833 INFO L175 Difference]: Start difference. First operand has 414 places, 406 transitions, 888 flow. Second operand 3 states and 1283 transitions. [2024-10-13 09:57:26,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 406 transitions, 928 flow [2024-10-13 09:57:26,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 406 transitions, 928 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,840 INFO L231 Difference]: Finished difference. Result has 413 places, 404 transitions, 894 flow [2024-10-13 09:57:26,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=413, PETRI_TRANSITIONS=404} [2024-10-13 09:57:26,841 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-10-13 09:57:26,841 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 404 transitions, 894 flow [2024-10-13 09:57:26,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:26,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:57:26,843 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:26,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash 845672241, now seen corresponding path program 1 times [2024-10-13 09:57:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289650624] [2024-10-13 09:57:26,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289650624] [2024-10-13 09:57:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289650624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025378151] [2024-10-13 09:57:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2024-10-13 09:57:26,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 404 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:26,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2024-10-13 09:57:26,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,259 INFO L124 PetriNetUnfolderBase]: 231/1986 cut-off events. [2024-10-13 09:57:27,259 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2024-10-13 09:57:27,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 1986 events. 231/1986 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13110 event pairs, 76 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2096. Up to 364 conditions per place. [2024-10-13 09:57:27,281 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-10-13 09:57:27,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 404 transitions, 934 flow [2024-10-13 09:57:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2024-10-13 09:57:27,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2024-10-13 09:57:27,288 INFO L175 Difference]: Start difference. First operand has 413 places, 404 transitions, 894 flow. Second operand 3 states and 1283 transitions. [2024-10-13 09:57:27,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 404 transitions, 934 flow [2024-10-13 09:57:27,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 404 transitions, 934 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:27,295 INFO L231 Difference]: Finished difference. Result has 412 places, 402 transitions, 900 flow [2024-10-13 09:57:27,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=402} [2024-10-13 09:57:27,298 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-10-13 09:57:27,298 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 402 transitions, 900 flow [2024-10-13 09:57:27,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:27,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:57:27,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2049955640, now seen corresponding path program 1 times [2024-10-13 09:57:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538860182] [2024-10-13 09:57:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:27,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538860182] [2024-10-13 09:57:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538860182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295210692] [2024-10-13 09:57:27,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 454 [2024-10-13 09:57:27,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 402 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:27,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 454 [2024-10-13 09:57:27,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,596 INFO L124 PetriNetUnfolderBase]: 55/1300 cut-off events. [2024-10-13 09:57:27,596 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2024-10-13 09:57:27,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1300 events. 55/1300 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6941 event pairs, 4 based on Foata normal form. 4/1205 useless extension candidates. Maximal degree in co-relation 1196. Up to 30 conditions per place. [2024-10-13 09:57:27,621 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2024-10-13 09:57:27,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 403 transitions, 930 flow [2024-10-13 09:57:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-10-13 09:57:27,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-10-13 09:57:27,626 INFO L175 Difference]: Start difference. First operand has 412 places, 402 transitions, 900 flow. Second operand 3 states and 1295 transitions. [2024-10-13 09:57:27,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 403 transitions, 930 flow [2024-10-13 09:57:27,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 403 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:27,634 INFO L231 Difference]: Finished difference. Result has 413 places, 401 transitions, 902 flow [2024-10-13 09:57:27,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=413, PETRI_TRANSITIONS=401} [2024-10-13 09:57:27,635 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-10-13 09:57:27,635 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 401 transitions, 902 flow [2024-10-13 09:57:27,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:27,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,636 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:57:27,636 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:27,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1092350566, now seen corresponding path program 1 times [2024-10-13 09:57:27,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440301472] [2024-10-13 09:57:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440301472] [2024-10-13 09:57:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440301472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724701018] [2024-10-13 09:57:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:27,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 401 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:27,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:27,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,078 INFO L124 PetriNetUnfolderBase]: 81/1576 cut-off events. [2024-10-13 09:57:28,078 INFO L125 PetriNetUnfolderBase]: For 19/31 co-relation queries the response was YES. [2024-10-13 09:57:28,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1576 events. 81/1576 cut-off events. For 19/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9341 event pairs, 14 based on Foata normal form. 1/1465 useless extension candidates. Maximal degree in co-relation 1758. Up to 53 conditions per place. [2024-10-13 09:57:28,107 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:28,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 402 transitions, 934 flow [2024-10-13 09:57:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2024-10-13 09:57:28,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2024-10-13 09:57:28,111 INFO L175 Difference]: Start difference. First operand has 413 places, 401 transitions, 902 flow. Second operand 3 states and 1293 transitions. [2024-10-13 09:57:28,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 402 transitions, 934 flow [2024-10-13 09:57:28,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 402 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:28,121 INFO L231 Difference]: Finished difference. Result has 412 places, 400 transitions, 900 flow [2024-10-13 09:57:28,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=400} [2024-10-13 09:57:28,122 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-10-13 09:57:28,122 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 400 transitions, 900 flow [2024-10-13 09:57:28,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:28,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:57:28,124 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -370909162, now seen corresponding path program 1 times [2024-10-13 09:57:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:28,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299168743] [2024-10-13 09:57:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299168743] [2024-10-13 09:57:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299168743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147083357] [2024-10-13 09:57:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:28,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 400 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:28,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:28,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,434 INFO L124 PetriNetUnfolderBase]: 65/1219 cut-off events. [2024-10-13 09:57:28,435 INFO L125 PetriNetUnfolderBase]: For 25/31 co-relation queries the response was YES. [2024-10-13 09:57:28,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1219 events. 65/1219 cut-off events. For 25/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6137 event pairs, 10 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 1397. Up to 63 conditions per place. [2024-10-13 09:57:28,458 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-10-13 09:57:28,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 401 transitions, 932 flow [2024-10-13 09:57:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2024-10-13 09:57:28,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2024-10-13 09:57:28,462 INFO L175 Difference]: Start difference. First operand has 412 places, 400 transitions, 900 flow. Second operand 3 states and 1293 transitions. [2024-10-13 09:57:28,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 401 transitions, 932 flow [2024-10-13 09:57:28,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 401 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:28,469 INFO L231 Difference]: Finished difference. Result has 411 places, 399 transitions, 898 flow [2024-10-13 09:57:28,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=411, PETRI_TRANSITIONS=399} [2024-10-13 09:57:28,471 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2024-10-13 09:57:28,471 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 399 transitions, 898 flow [2024-10-13 09:57:28,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:28,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:28,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:28,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:57:28,472 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:28,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash -433715592, now seen corresponding path program 1 times [2024-10-13 09:57:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909793326] [2024-10-13 09:57:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909793326] [2024-10-13 09:57:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909793326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261129292] [2024-10-13 09:57:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 454 [2024-10-13 09:57:28,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 399 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:28,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 454 [2024-10-13 09:57:28,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,771 INFO L124 PetriNetUnfolderBase]: 49/1259 cut-off events. [2024-10-13 09:57:28,771 INFO L125 PetriNetUnfolderBase]: For 7/16 co-relation queries the response was YES. [2024-10-13 09:57:28,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1259 events. 49/1259 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6503 event pairs, 2 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1326. Up to 30 conditions per place. [2024-10-13 09:57:28,790 INFO L140 encePairwiseOnDemand]: 452/454 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2024-10-13 09:57:28,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 398 transitions, 914 flow [2024-10-13 09:57:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2024-10-13 09:57:28,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9522760646108663 [2024-10-13 09:57:28,793 INFO L175 Difference]: Start difference. First operand has 411 places, 399 transitions, 898 flow. Second operand 3 states and 1297 transitions. [2024-10-13 09:57:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 398 transitions, 914 flow [2024-10-13 09:57:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 398 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:28,800 INFO L231 Difference]: Finished difference. Result has 410 places, 398 transitions, 894 flow [2024-10-13 09:57:28,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=410, PETRI_TRANSITIONS=398} [2024-10-13 09:57:28,801 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2024-10-13 09:57:28,801 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 398 transitions, 894 flow [2024-10-13 09:57:28,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:28,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:28,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:57:28,802 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 41553439, now seen corresponding path program 1 times [2024-10-13 09:57:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252104738] [2024-10-13 09:57:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252104738] [2024-10-13 09:57:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252104738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936778499] [2024-10-13 09:57:28,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:28,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 398 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:28,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:28,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:29,124 INFO L124 PetriNetUnfolderBase]: 60/1492 cut-off events. [2024-10-13 09:57:29,124 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-10-13 09:57:29,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1492 events. 60/1492 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8525 event pairs, 7 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 1694. Up to 36 conditions per place. [2024-10-13 09:57:29,152 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 10 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2024-10-13 09:57:29,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 396 transitions, 912 flow [2024-10-13 09:57:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2024-10-13 09:57:29,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478707782672541 [2024-10-13 09:57:29,155 INFO L175 Difference]: Start difference. First operand has 410 places, 398 transitions, 894 flow. Second operand 3 states and 1291 transitions. [2024-10-13 09:57:29,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 396 transitions, 912 flow [2024-10-13 09:57:29,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 396 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:29,162 INFO L231 Difference]: Finished difference. Result has 409 places, 396 transitions, 891 flow [2024-10-13 09:57:29,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=409, PETRI_TRANSITIONS=396} [2024-10-13 09:57:29,163 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -16 predicate places. [2024-10-13 09:57:29,164 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 396 transitions, 891 flow [2024-10-13 09:57:29,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:29,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:29,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 09:57:29,165 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-13 09:57:29,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1033353884, now seen corresponding path program 1 times [2024-10-13 09:57:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197378212] [2024-10-13 09:57:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197378212] [2024-10-13 09:57:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197378212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792702463] [2024-10-13 09:57:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:29,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:29,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-10-13 09:57:29,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 396 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:29,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:29,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-10-13 09:57:29,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:29,446 INFO L124 PetriNetUnfolderBase]: 50/1171 cut-off events. [2024-10-13 09:57:29,446 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-10-13 09:57:29,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1171 events. 50/1171 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5851 event pairs, 5 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1349. Up to 36 conditions per place. [2024-10-13 09:57:29,464 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 0 selfloop transitions, 0 changer transitions 394/394 dead transitions. [2024-10-13 09:57:29,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 394 transitions, 907 flow [2024-10-13 09:57:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2024-10-13 09:57:29,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.947136563876652 [2024-10-13 09:57:29,467 INFO L175 Difference]: Start difference. First operand has 409 places, 396 transitions, 891 flow. Second operand 3 states and 1290 transitions. [2024-10-13 09:57:29,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 394 transitions, 907 flow [2024-10-13 09:57:29,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 394 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:29,472 INFO L231 Difference]: Finished difference. Result has 408 places, 0 transitions, 0 flow [2024-10-13 09:57:29,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=408, PETRI_TRANSITIONS=0} [2024-10-13 09:57:29,473 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -17 predicate places. [2024-10-13 09:57:29,473 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 0 transitions, 0 flow [2024-10-13 09:57:29,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:29,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2024-10-13 09:57:29,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2024-10-13 09:57:29,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2024-10-13 09:57:29,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2024-10-13 09:57:29,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2024-10-13 09:57:29,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2024-10-13 09:57:29,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2024-10-13 09:57:29,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2024-10-13 09:57:29,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2024-10-13 09:57:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2024-10-13 09:57:29,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2024-10-13 09:57:29,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2024-10-13 09:57:29,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2024-10-13 09:57:29,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2024-10-13 09:57:29,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2024-10-13 09:57:29,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2024-10-13 09:57:29,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2024-10-13 09:57:29,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2024-10-13 09:57:29,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2024-10-13 09:57:29,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2024-10-13 09:57:29,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2024-10-13 09:57:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 09:57:29,493 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:29,499 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:57:29,500 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:57:29,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:57:29 BasicIcfg [2024-10-13 09:57:29,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:57:29,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:57:29,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:57:29,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:57:29,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:20" (3/4) ... [2024-10-13 09:57:29,512 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:57:29,516 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:57:29,516 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:57:29,516 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 09:57:29,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 09:57:29,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:57:29,523 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:57:29,523 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:57:29,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:57:29,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:57:29,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:57:29,628 INFO L158 Benchmark]: Toolchain (without parser) took 10866.15ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 110.5MB in the beginning and 415.8MB in the end (delta: -305.3MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,628 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:57:29,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.66ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 96.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.27ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 93.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,629 INFO L158 Benchmark]: Boogie Preprocessor took 66.40ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 91.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,629 INFO L158 Benchmark]: RCFGBuilder took 990.56ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 133.0MB in the end (delta: -41.4MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,629 INFO L158 Benchmark]: TraceAbstraction took 9329.36ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 132.6MB in the beginning and 422.1MB in the end (delta: -289.5MB). Peak memory consumption was 338.6MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,629 INFO L158 Benchmark]: Witness Printer took 121.47ms. Allocated memory is still 553.6MB. Free memory was 422.1MB in the beginning and 415.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 09:57:29,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.66ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 96.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.27ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 93.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.40ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 91.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 990.56ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 133.0MB in the end (delta: -41.4MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9329.36ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 132.6MB in the beginning and 422.1MB in the end (delta: -289.5MB). Peak memory consumption was 338.6MB. Max. memory is 16.1GB. * Witness Printer took 121.47ms. Allocated memory is still 553.6MB. Free memory was 422.1MB in the beginning and 415.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 710 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 129 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=19, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3246 ConstructedInterpolants, 0 QuantifiedInterpolants, 3294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:57:29,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE