./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:59:42,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:59:42,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:59:42,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:59:42,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:59:42,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:59:42,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:59:42,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:59:42,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:59:42,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:59:42,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:59:42,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:59:42,676 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:59:42,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:59:42,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:59:42,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:59:42,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:59:42,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:59:42,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:59:42,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:59:42,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:59:42,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:59:42,683 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:59:42,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:59:42,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:59:42,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:59:42,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:59:42,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:59:42,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:59:42,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:59:42,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:59:42,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:42,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:59:42,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:59:42,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:59:42,688 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2024-11-19 05:59:42,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:59:42,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:59:42,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:59:42,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:59:42,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:59:42,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2024-11-19 05:59:44,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:59:44,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:59:44,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2024-11-19 05:59:44,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57266112c/28cb844bbd2446ad8c59da46f2b513af/FLAGdaf0cb5df [2024-11-19 05:59:44,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57266112c/28cb844bbd2446ad8c59da46f2b513af [2024-11-19 05:59:44,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:59:44,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:59:44,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:44,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:59:44,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:59:44,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:44,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef99d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44, skipping insertion in model container [2024-11-19 05:59:44,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:44,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:59:44,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:44,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:59:44,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:44,980 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:59:44,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44 WrapperNode [2024-11-19 05:59:44,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:44,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:44,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:59:44,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:59:44,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:44,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,033 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 368 [2024-11-19 05:59:45,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:45,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:59:45,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:59:45,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:59:45,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:59:45,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:59:45,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:59:45,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:59:45,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (1/1) ... [2024-11-19 05:59:45,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:59:45,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:59:45,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:59:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:59:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:59:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:59:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:59:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:59:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:59:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:59:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:59:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:59:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:59:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:59:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:59:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:59:45,178 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:59:45,292 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:59:45,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:59:45,869 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:59:45,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:59:45,904 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:59:45,904 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 05:59:45,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:45 BoogieIcfgContainer [2024-11-19 05:59:45,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:59:45,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:59:45,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:59:45,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:59:45,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:59:44" (1/3) ... [2024-11-19 05:59:45,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dad4d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:45, skipping insertion in model container [2024-11-19 05:59:45,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:44" (2/3) ... [2024-11-19 05:59:45,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dad4d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:45, skipping insertion in model container [2024-11-19 05:59:45,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:45" (3/3) ... [2024-11-19 05:59:45,915 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2024-11-19 05:59:45,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:59:45,944 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-19 05:59:45,944 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:59:46,092 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:59:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 483 places, 502 transitions, 1025 flow [2024-11-19 05:59:46,254 INFO L124 PetriNetUnfolderBase]: 29/499 cut-off events. [2024-11-19 05:59:46,254 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:59:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 499 events. 29/499 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1009 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 382. Up to 2 conditions per place. [2024-11-19 05:59:46,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 483 places, 502 transitions, 1025 flow [2024-11-19 05:59:46,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 464 places, 482 transitions, 982 flow [2024-11-19 05:59:46,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:59:46,289 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;@51f266aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:59:46,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-19 05:59:46,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:59:46,293 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-19 05:59:46,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:59:46,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:46,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:46,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 303787312, now seen corresponding path program 1 times [2024-11-19 05:59:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301138756] [2024-11-19 05:59:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301138756] [2024-11-19 05:59:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301138756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:46,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:46,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592369324] [2024-11-19 05:59:46,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:46,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 502 [2024-11-19 05:59:46,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 482 transitions, 982 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:46,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:46,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 502 [2024-11-19 05:59:46,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:46,744 INFO L124 PetriNetUnfolderBase]: 20/998 cut-off events. [2024-11-19 05:59:46,744 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-19 05:59:46,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 998 events. 20/998 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4524 event pairs, 7 based on Foata normal form. 55/935 useless extension candidates. Maximal degree in co-relation 757. Up to 31 conditions per place. [2024-11-19 05:59:46,760 INFO L140 encePairwiseOnDemand]: 477/502 looper letters, 13 selfloop transitions, 2 changer transitions 5/459 dead transitions. [2024-11-19 05:59:46,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 459 transitions, 966 flow [2024-11-19 05:59:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1421 transitions. [2024-11-19 05:59:46,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435590969455512 [2024-11-19 05:59:46,780 INFO L175 Difference]: Start difference. First operand has 464 places, 482 transitions, 982 flow. Second operand 3 states and 1421 transitions. [2024-11-19 05:59:46,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 459 transitions, 966 flow [2024-11-19 05:59:46,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 459 transitions, 954 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:59:46,795 INFO L231 Difference]: Finished difference. Result has 459 places, 454 transitions, 918 flow [2024-11-19 05:59:46,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=459, PETRI_TRANSITIONS=454} [2024-11-19 05:59:46,800 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -5 predicate places. [2024-11-19 05:59:46,801 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 454 transitions, 918 flow [2024-11-19 05:59:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:46,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:46,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] [2024-11-19 05:59:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:59:46,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:46,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash -949995555, now seen corresponding path program 1 times [2024-11-19 05:59:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:46,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462845348] [2024-11-19 05:59:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462845348] [2024-11-19 05:59:46,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462845348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:46,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:46,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700437074] [2024-11-19 05:59:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:46,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:46,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:46,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 502 [2024-11-19 05:59:46,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 454 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:46,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:46,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 502 [2024-11-19 05:59:46,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:47,073 INFO L124 PetriNetUnfolderBase]: 14/739 cut-off events. [2024-11-19 05:59:47,073 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:59:47,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 739 events. 14/739 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2724 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 747. Up to 28 conditions per place. [2024-11-19 05:59:47,083 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 14 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2024-11-19 05:59:47,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 948 flow [2024-11-19 05:59:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2024-11-19 05:59:47,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9276228419654714 [2024-11-19 05:59:47,086 INFO L175 Difference]: Start difference. First operand has 459 places, 454 transitions, 918 flow. Second operand 3 states and 1397 transitions. [2024-11-19 05:59:47,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 948 flow [2024-11-19 05:59:47,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:47,093 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 916 flow [2024-11-19 05:59:47,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=453, PETRI_TRANSITIONS=453} [2024-11-19 05:59:47,094 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -11 predicate places. [2024-11-19 05:59:47,095 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 916 flow [2024-11-19 05:59:47,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:47,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:47,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:47,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:59:47,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 743321691, now seen corresponding path program 1 times [2024-11-19 05:59:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894668378] [2024-11-19 05:59:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:47,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894668378] [2024-11-19 05:59:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894668378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280214385] [2024-11-19 05:59:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:47,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:47,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 502 [2024-11-19 05:59:47,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 916 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:47,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:47,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 502 [2024-11-19 05:59:47,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:47,330 INFO L124 PetriNetUnfolderBase]: 26/996 cut-off events. [2024-11-19 05:59:47,330 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 05:59:47,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 996 events. 26/996 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4727 event pairs, 12 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1018. Up to 48 conditions per place. [2024-11-19 05:59:47,348 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 16 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2024-11-19 05:59:47,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 448 transitions, 940 flow [2024-11-19 05:59:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-11-19 05:59:47,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9229747675962815 [2024-11-19 05:59:47,351 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 916 flow. Second operand 3 states and 1390 transitions. [2024-11-19 05:59:47,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 448 transitions, 940 flow [2024-11-19 05:59:47,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:47,358 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 904 flow [2024-11-19 05:59:47,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2024-11-19 05:59:47,359 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -16 predicate places. [2024-11-19 05:59:47,360 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 904 flow [2024-11-19 05:59:47,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:47,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:47,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:59:47,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1095486735, now seen corresponding path program 1 times [2024-11-19 05:59:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918021179] [2024-11-19 05:59:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918021179] [2024-11-19 05:59:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918021179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908798577] [2024-11-19 05:59:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:47,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:47,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:47,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:47,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 502 [2024-11-19 05:59:47,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 421.5) internal successors, (2529), 6 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:47,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:47,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 502 [2024-11-19 05:59:47,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:49,961 INFO L124 PetriNetUnfolderBase]: 1895/15161 cut-off events. [2024-11-19 05:59:49,961 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-19 05:59:50,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18077 conditions, 15161 events. 1895/15161 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 183555 event pairs, 1520 based on Foata normal form. 0/13419 useless extension candidates. Maximal degree in co-relation 18039. Up to 2812 conditions per place. [2024-11-19 05:59:50,057 INFO L140 encePairwiseOnDemand]: 490/502 looper letters, 46 selfloop transitions, 10 changer transitions 0/446 dead transitions. [2024-11-19 05:59:50,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1012 flow [2024-11-19 05:59:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2578 transitions. [2024-11-19 05:59:50,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8559096945551129 [2024-11-19 05:59:50,061 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 904 flow. Second operand 6 states and 2578 transitions. [2024-11-19 05:59:50,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1012 flow [2024-11-19 05:59:50,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 446 transitions, 1011 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:50,067 INFO L231 Difference]: Finished difference. Result has 450 places, 446 transitions, 919 flow [2024-11-19 05:59:50,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=450, PETRI_TRANSITIONS=446} [2024-11-19 05:59:50,068 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -14 predicate places. [2024-11-19 05:59:50,068 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 446 transitions, 919 flow [2024-11-19 05:59:50,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 421.5) internal successors, (2529), 6 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:50,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:50,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:59:50,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:50,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2011954115, now seen corresponding path program 1 times [2024-11-19 05:59:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:50,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18269429] [2024-11-19 05:59:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18269429] [2024-11-19 05:59:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18269429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433647734] [2024-11-19 05:59:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:50,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:50,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:50,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:50,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 502 [2024-11-19 05:59:50,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 446 transitions, 919 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:50,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 502 [2024-11-19 05:59:50,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:50,203 INFO L124 PetriNetUnfolderBase]: 25/837 cut-off events. [2024-11-19 05:59:50,203 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:59:50,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 25/837 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3500 event pairs, 15 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 866. Up to 40 conditions per place. [2024-11-19 05:59:50,214 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 12 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2024-11-19 05:59:50,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 445 transitions, 945 flow [2024-11-19 05:59:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1401 transitions. [2024-11-19 05:59:50,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302788844621513 [2024-11-19 05:59:50,217 INFO L175 Difference]: Start difference. First operand has 450 places, 446 transitions, 919 flow. Second operand 3 states and 1401 transitions. [2024-11-19 05:59:50,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 445 transitions, 945 flow [2024-11-19 05:59:50,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 445 transitions, 925 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:50,222 INFO L231 Difference]: Finished difference. Result has 446 places, 445 transitions, 901 flow [2024-11-19 05:59:50,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=446, PETRI_TRANSITIONS=445} [2024-11-19 05:59:50,224 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -18 predicate places. [2024-11-19 05:59:50,224 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 445 transitions, 901 flow [2024-11-19 05:59:50,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:50,225 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] [2024-11-19 05:59:50,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:59:50,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:50,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1360928316, now seen corresponding path program 1 times [2024-11-19 05:59:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156862542] [2024-11-19 05:59:50,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:50,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156862542] [2024-11-19 05:59:50,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156862542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:50,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:50,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158105512] [2024-11-19 05:59:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:50,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:50,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 502 [2024-11-19 05:59:50,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:50,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 502 [2024-11-19 05:59:50,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:50,365 INFO L124 PetriNetUnfolderBase]: 25/836 cut-off events. [2024-11-19 05:59:50,365 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:59:50,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 836 events. 25/836 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3407 event pairs, 15 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 851. Up to 40 conditions per place. [2024-11-19 05:59:50,377 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 12 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2024-11-19 05:59:50,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 444 transitions, 927 flow [2024-11-19 05:59:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1401 transitions. [2024-11-19 05:59:50,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302788844621513 [2024-11-19 05:59:50,380 INFO L175 Difference]: Start difference. First operand has 446 places, 445 transitions, 901 flow. Second operand 3 states and 1401 transitions. [2024-11-19 05:59:50,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 444 transitions, 927 flow [2024-11-19 05:59:50,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 444 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:50,385 INFO L231 Difference]: Finished difference. Result has 445 places, 444 transitions, 899 flow [2024-11-19 05:59:50,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=445, PETRI_TRANSITIONS=444} [2024-11-19 05:59:50,386 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -19 predicate places. [2024-11-19 05:59:50,386 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 444 transitions, 899 flow [2024-11-19 05:59:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:50,387 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] [2024-11-19 05:59:50,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:59:50,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:50,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -983620509, now seen corresponding path program 1 times [2024-11-19 05:59:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254572539] [2024-11-19 05:59:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:50,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254572539] [2024-11-19 05:59:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254572539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:50,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115606524] [2024-11-19 05:59:50,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:50,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:50,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 502 [2024-11-19 05:59:50,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:50,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 502 [2024-11-19 05:59:50,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:50,629 INFO L124 PetriNetUnfolderBase]: 38/1247 cut-off events. [2024-11-19 05:59:50,630 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 05:59:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1247 events. 38/1247 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6842 event pairs, 20 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1276. Up to 56 conditions per place. [2024-11-19 05:59:50,646 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 14 selfloop transitions, 1 changer transitions 0/440 dead transitions. [2024-11-19 05:59:50,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 440 transitions, 921 flow [2024-11-19 05:59:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-11-19 05:59:50,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9269588313413014 [2024-11-19 05:59:50,649 INFO L175 Difference]: Start difference. First operand has 445 places, 444 transitions, 899 flow. Second operand 3 states and 1396 transitions. [2024-11-19 05:59:50,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 440 transitions, 921 flow [2024-11-19 05:59:50,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 440 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:50,654 INFO L231 Difference]: Finished difference. Result has 441 places, 440 transitions, 889 flow [2024-11-19 05:59:50,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=441, PETRI_TRANSITIONS=440} [2024-11-19 05:59:50,655 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places. [2024-11-19 05:59:50,656 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 440 transitions, 889 flow [2024-11-19 05:59:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:50,657 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] [2024-11-19 05:59:50,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:59:50,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 325829172, now seen corresponding path program 1 times [2024-11-19 05:59:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188677951] [2024-11-19 05:59:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:50,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:50,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188677951] [2024-11-19 05:59:50,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188677951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594653594] [2024-11-19 05:59:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:50,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:50,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:50,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:50,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 502 [2024-11-19 05:59:50,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 440 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 466.0) internal successors, (1398), 3 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:50,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 502 [2024-11-19 05:59:50,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:50,768 INFO L124 PetriNetUnfolderBase]: 15/627 cut-off events. [2024-11-19 05:59:50,768 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:59:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 627 events. 15/627 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1976 event pairs, 2 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 628. Up to 13 conditions per place. [2024-11-19 05:59:50,776 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 8 selfloop transitions, 2 changer transitions 2/440 dead transitions. [2024-11-19 05:59:50,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 440 transitions, 915 flow [2024-11-19 05:59:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1409 transitions. [2024-11-19 05:59:50,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9355909694555112 [2024-11-19 05:59:50,779 INFO L175 Difference]: Start difference. First operand has 441 places, 440 transitions, 889 flow. Second operand 3 states and 1409 transitions. [2024-11-19 05:59:50,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 440 transitions, 915 flow [2024-11-19 05:59:50,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 440 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:50,785 INFO L231 Difference]: Finished difference. Result has 440 places, 436 transitions, 883 flow [2024-11-19 05:59:50,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=883, PETRI_PLACES=440, PETRI_TRANSITIONS=436} [2024-11-19 05:59:50,786 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -24 predicate places. [2024-11-19 05:59:50,787 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 436 transitions, 883 flow [2024-11-19 05:59:50,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 466.0) internal successors, (1398), 3 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:50,788 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] [2024-11-19 05:59:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:59:50,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -410740746, now seen corresponding path program 1 times [2024-11-19 05:59:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858010014] [2024-11-19 05:59:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858010014] [2024-11-19 05:59:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858010014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:50,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087938733] [2024-11-19 05:59:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:50,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:50,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 502 [2024-11-19 05:59:50,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 436 transitions, 883 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:50,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:50,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 502 [2024-11-19 05:59:50,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:51,200 INFO L124 PetriNetUnfolderBase]: 114/2761 cut-off events. [2024-11-19 05:59:51,200 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-19 05:59:51,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 2761 events. 114/2761 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 21999 event pairs, 22 based on Foata normal form. 0/2496 useless extension candidates. Maximal degree in co-relation 2917. Up to 159 conditions per place. [2024-11-19 05:59:51,226 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 16 selfloop transitions, 3 changer transitions 0/440 dead transitions. [2024-11-19 05:59:51,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 440 transitions, 933 flow [2024-11-19 05:59:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2024-11-19 05:59:51,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9349269588313412 [2024-11-19 05:59:51,229 INFO L175 Difference]: Start difference. First operand has 440 places, 436 transitions, 883 flow. Second operand 3 states and 1408 transitions. [2024-11-19 05:59:51,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 440 transitions, 933 flow [2024-11-19 05:59:51,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 440 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:51,237 INFO L231 Difference]: Finished difference. Result has 436 places, 436 transitions, 894 flow [2024-11-19 05:59:51,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=436, PETRI_TRANSITIONS=436} [2024-11-19 05:59:51,239 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -28 predicate places. [2024-11-19 05:59:51,239 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 436 transitions, 894 flow [2024-11-19 05:59:51,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:51,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:51,240 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] [2024-11-19 05:59:51,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:59:51,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -231852838, now seen corresponding path program 1 times [2024-11-19 05:59:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513784509] [2024-11-19 05:59:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:51,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:51,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513784509] [2024-11-19 05:59:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513784509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:59:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897029460] [2024-11-19 05:59:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:59:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:59:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:59:51,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 502 [2024-11-19 05:59:51,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 436 transitions, 894 flow. Second operand has 7 states, 7 states have (on average 451.0) internal successors, (3157), 7 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:51,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:51,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 502 [2024-11-19 05:59:51,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:52,012 INFO L124 PetriNetUnfolderBase]: 65/2048 cut-off events. [2024-11-19 05:59:52,012 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2024-11-19 05:59:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 2048 events. 65/2048 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12750 event pairs, 16 based on Foata normal form. 4/1887 useless extension candidates. Maximal degree in co-relation 2217. Up to 63 conditions per place. [2024-11-19 05:59:52,041 INFO L140 encePairwiseOnDemand]: 481/502 looper letters, 29 selfloop transitions, 28 changer transitions 0/464 dead transitions. [2024-11-19 05:59:52,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 464 transitions, 1071 flow [2024-11-19 05:59:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:59:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 05:59:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4538 transitions. [2024-11-19 05:59:52,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9039840637450199 [2024-11-19 05:59:52,062 INFO L175 Difference]: Start difference. First operand has 436 places, 436 transitions, 894 flow. Second operand 10 states and 4538 transitions. [2024-11-19 05:59:52,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 464 transitions, 1071 flow [2024-11-19 05:59:52,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 464 transitions, 1071 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:52,076 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 1023 flow [2024-11-19 05:59:52,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1023, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2024-11-19 05:59:52,077 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -15 predicate places. [2024-11-19 05:59:52,078 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 1023 flow [2024-11-19 05:59:52,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 451.0) internal successors, (3157), 7 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:52,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:52,080 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:52,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:59:52,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:52,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash -833451261, now seen corresponding path program 1 times [2024-11-19 05:59:52,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:52,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805209249] [2024-11-19 05:59:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:52,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805209249] [2024-11-19 05:59:52,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805209249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:52,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:52,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11152084] [2024-11-19 05:59:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:52,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:59:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:52,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:59:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:59:52,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 502 [2024-11-19 05:59:52,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:52,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:52,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 502 [2024-11-19 05:59:52,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:52,733 INFO L124 PetriNetUnfolderBase]: 99/2466 cut-off events. [2024-11-19 05:59:52,734 INFO L125 PetriNetUnfolderBase]: For 61/70 co-relation queries the response was YES. [2024-11-19 05:59:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 2466 events. 99/2466 cut-off events. For 61/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 16790 event pairs, 34 based on Foata normal form. 8/2275 useless extension candidates. Maximal degree in co-relation 2758. Up to 103 conditions per place. [2024-11-19 05:59:52,770 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 22 selfloop transitions, 5 changer transitions 0/462 dead transitions. [2024-11-19 05:59:52,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 462 transitions, 1104 flow [2024-11-19 05:59:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:59:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 05:59:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2323 transitions. [2024-11-19 05:59:52,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9254980079681275 [2024-11-19 05:59:52,775 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 1023 flow. Second operand 5 states and 2323 transitions. [2024-11-19 05:59:52,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 462 transitions, 1104 flow [2024-11-19 05:59:52,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 462 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:52,784 INFO L231 Difference]: Finished difference. Result has 455 places, 454 transitions, 1048 flow [2024-11-19 05:59:52,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1048, PETRI_PLACES=455, PETRI_TRANSITIONS=454} [2024-11-19 05:59:52,787 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places. [2024-11-19 05:59:52,787 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 454 transitions, 1048 flow [2024-11-19 05:59:52,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:52,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:52,789 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] [2024-11-19 05:59:52,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:59:52,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 457606150, now seen corresponding path program 1 times [2024-11-19 05:59:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:52,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646236062] [2024-11-19 05:59:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:52,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646236062] [2024-11-19 05:59:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646236062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776325485] [2024-11-19 05:59:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:53,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:53,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 502 [2024-11-19 05:59:53,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 454 transitions, 1048 flow. Second operand has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:53,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:53,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 502 [2024-11-19 05:59:53,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:53,783 INFO L124 PetriNetUnfolderBase]: 116/2548 cut-off events. [2024-11-19 05:59:53,783 INFO L125 PetriNetUnfolderBase]: For 143/152 co-relation queries the response was YES. [2024-11-19 05:59:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 2548 events. 116/2548 cut-off events. For 143/152 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17140 event pairs, 31 based on Foata normal form. 0/2349 useless extension candidates. Maximal degree in co-relation 2972. Up to 140 conditions per place. [2024-11-19 05:59:53,818 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 28 selfloop transitions, 5 changer transitions 0/461 dead transitions. [2024-11-19 05:59:53,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 461 transitions, 1136 flow [2024-11-19 05:59:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2024-11-19 05:59:53,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130146082337317 [2024-11-19 05:59:53,823 INFO L175 Difference]: Start difference. First operand has 455 places, 454 transitions, 1048 flow. Second operand 6 states and 2750 transitions. [2024-11-19 05:59:53,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 461 transitions, 1136 flow [2024-11-19 05:59:53,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 461 transitions, 1131 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:53,830 INFO L231 Difference]: Finished difference. Result has 457 places, 453 transitions, 1051 flow [2024-11-19 05:59:53,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=457, PETRI_TRANSITIONS=453} [2024-11-19 05:59:53,831 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -7 predicate places. [2024-11-19 05:59:53,831 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 453 transitions, 1051 flow [2024-11-19 05:59:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:53,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:53,833 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] [2024-11-19 05:59:53,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:59:53,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:53,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1672886920, now seen corresponding path program 1 times [2024-11-19 05:59:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:53,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110154165] [2024-11-19 05:59:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110154165] [2024-11-19 05:59:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110154165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:53,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402492329] [2024-11-19 05:59:53,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:53,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:53,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 502 [2024-11-19 05:59:53,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 453 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 463.6666666666667) internal successors, (1391), 3 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:53,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:53,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 502 [2024-11-19 05:59:53,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:54,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1336] L65-->L65-1: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][227], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 422#L56-1true, 54#L65-1true, 517#true, 515#(= |#race~A~0| 0), 390#L48-3true, 545#true, Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 389#L86-4true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 522#(<= ~N~0 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2024-11-19 05:59:54,681 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-19 05:59:54,681 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-19 05:59:54,681 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-19 05:59:54,682 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is cut-off event [2024-11-19 05:59:54,723 INFO L124 PetriNetUnfolderBase]: 264/6416 cut-off events. [2024-11-19 05:59:54,723 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-19 05:59:54,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7142 conditions, 6416 events. 264/6416 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 60902 event pairs, 47 based on Foata normal form. 0/5925 useless extension candidates. Maximal degree in co-relation 7093. Up to 312 conditions per place. [2024-11-19 05:59:54,766 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 16 selfloop transitions, 3 changer transitions 0/457 dead transitions. [2024-11-19 05:59:54,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 457 transitions, 1101 flow [2024-11-19 05:59:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2024-11-19 05:59:54,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9349269588313412 [2024-11-19 05:59:54,769 INFO L175 Difference]: Start difference. First operand has 457 places, 453 transitions, 1051 flow. Second operand 3 states and 1408 transitions. [2024-11-19 05:59:54,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 457 transitions, 1101 flow [2024-11-19 05:59:54,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 457 transitions, 1091 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:54,774 INFO L231 Difference]: Finished difference. Result has 452 places, 453 transitions, 1056 flow [2024-11-19 05:59:54,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=452, PETRI_TRANSITIONS=453} [2024-11-19 05:59:54,776 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -12 predicate places. [2024-11-19 05:59:54,776 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 453 transitions, 1056 flow [2024-11-19 05:59:54,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.6666666666667) internal successors, (1391), 3 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:54,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:54,777 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] [2024-11-19 05:59:54,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:59:54,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1517007793, now seen corresponding path program 1 times [2024-11-19 05:59:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127599105] [2024-11-19 05:59:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:55,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127599105] [2024-11-19 05:59:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127599105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:55,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:55,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511723688] [2024-11-19 05:59:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:55,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:55,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 502 [2024-11-19 05:59:55,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 453 transitions, 1056 flow. Second operand has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:55,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:55,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 502 [2024-11-19 05:59:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:55,913 INFO L124 PetriNetUnfolderBase]: 330/3752 cut-off events. [2024-11-19 05:59:55,914 INFO L125 PetriNetUnfolderBase]: For 228/320 co-relation queries the response was YES. [2024-11-19 05:59:55,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 3752 events. 330/3752 cut-off events. For 228/320 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 31441 event pairs, 59 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 4570. Up to 211 conditions per place. [2024-11-19 05:59:55,956 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 26 selfloop transitions, 5 changer transitions 0/460 dead transitions. [2024-11-19 05:59:55,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 460 transitions, 1140 flow [2024-11-19 05:59:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2024-11-19 05:59:55,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130146082337317 [2024-11-19 05:59:55,962 INFO L175 Difference]: Start difference. First operand has 452 places, 453 transitions, 1056 flow. Second operand 6 states and 2750 transitions. [2024-11-19 05:59:55,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 460 transitions, 1140 flow [2024-11-19 05:59:55,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 460 transitions, 1140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:55,968 INFO L231 Difference]: Finished difference. Result has 456 places, 452 transitions, 1064 flow [2024-11-19 05:59:55,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=456, PETRI_TRANSITIONS=452} [2024-11-19 05:59:55,969 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -8 predicate places. [2024-11-19 05:59:55,970 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 452 transitions, 1064 flow [2024-11-19 05:59:55,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:55,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:55,971 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] [2024-11-19 05:59:55,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:59:55,971 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1565874604, now seen corresponding path program 1 times [2024-11-19 05:59:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817527201] [2024-11-19 05:59:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817527201] [2024-11-19 05:59:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817527201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843969859] [2024-11-19 05:59:56,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:56,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:56,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 502 [2024-11-19 05:59:56,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 452 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:56,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:56,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 502 [2024-11-19 05:59:56,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:57,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1240] L56-->L56-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][229], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 378#L87-1true, 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 555#true, Black: 551#true, 561#true, 422#L56-1true, 54#L65-1true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2024-11-19 05:59:57,126 INFO L294 olderBase$Statistics]: this new event has 334 ancestors and is cut-off event [2024-11-19 05:59:57,126 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2024-11-19 05:59:57,126 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-11-19 05:59:57,126 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-11-19 05:59:57,145 INFO L124 PetriNetUnfolderBase]: 180/3691 cut-off events. [2024-11-19 05:59:57,145 INFO L125 PetriNetUnfolderBase]: For 162/171 co-relation queries the response was YES. [2024-11-19 05:59:57,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 3691 events. 180/3691 cut-off events. For 162/171 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 28979 event pairs, 47 based on Foata normal form. 0/3441 useless extension candidates. Maximal degree in co-relation 4379. Up to 155 conditions per place. [2024-11-19 05:59:57,193 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 28 selfloop transitions, 5 changer transitions 0/459 dead transitions. [2024-11-19 05:59:57,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 459 transitions, 1152 flow [2024-11-19 05:59:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2024-11-19 05:59:57,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130146082337317 [2024-11-19 05:59:57,198 INFO L175 Difference]: Start difference. First operand has 456 places, 452 transitions, 1064 flow. Second operand 6 states and 2750 transitions. [2024-11-19 05:59:57,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 459 transitions, 1152 flow [2024-11-19 05:59:57,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 459 transitions, 1142 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:57,207 INFO L231 Difference]: Finished difference. Result has 455 places, 451 transitions, 1062 flow [2024-11-19 05:59:57,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1062, PETRI_PLACES=455, PETRI_TRANSITIONS=451} [2024-11-19 05:59:57,209 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places. [2024-11-19 05:59:57,209 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 451 transitions, 1062 flow [2024-11-19 05:59:57,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:57,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:57,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:59:57,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:57,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2095905013, now seen corresponding path program 1 times [2024-11-19 05:59:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532826390] [2024-11-19 05:59:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532826390] [2024-11-19 05:59:57,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532826390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355448338] [2024-11-19 05:59:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:57,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 502 [2024-11-19 05:59:57,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 451 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:57,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:57,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 502 [2024-11-19 05:59:57,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:58,553 INFO L124 PetriNetUnfolderBase]: 253/3511 cut-off events. [2024-11-19 05:59:58,554 INFO L125 PetriNetUnfolderBase]: For 168/275 co-relation queries the response was YES. [2024-11-19 05:59:58,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4221 conditions, 3511 events. 253/3511 cut-off events. For 168/275 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 28591 event pairs, 59 based on Foata normal form. 0/3276 useless extension candidates. Maximal degree in co-relation 4170. Up to 216 conditions per place. [2024-11-19 05:59:58,607 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 26 selfloop transitions, 5 changer transitions 14/458 dead transitions. [2024-11-19 05:59:58,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 458 transitions, 1146 flow [2024-11-19 05:59:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2024-11-19 05:59:58,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130146082337317 [2024-11-19 05:59:58,612 INFO L175 Difference]: Start difference. First operand has 455 places, 451 transitions, 1062 flow. Second operand 6 states and 2750 transitions. [2024-11-19 05:59:58,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 458 transitions, 1146 flow [2024-11-19 05:59:58,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 458 transitions, 1136 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:58,619 INFO L231 Difference]: Finished difference. Result has 454 places, 436 transitions, 989 flow [2024-11-19 05:59:58,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=989, PETRI_PLACES=454, PETRI_TRANSITIONS=436} [2024-11-19 05:59:58,620 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -10 predicate places. [2024-11-19 05:59:58,620 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 436 transitions, 989 flow [2024-11-19 05:59:58,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:58,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:58,622 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] [2024-11-19 05:59:58,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:59:58,622 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:58,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1013239596, now seen corresponding path program 1 times [2024-11-19 05:59:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107370006] [2024-11-19 05:59:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:58,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:59:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107370006] [2024-11-19 05:59:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107370006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:59,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:59,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:59,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835299838] [2024-11-19 05:59:59,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:59,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:59,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:59,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:59,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 502 [2024-11-19 05:59:59,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 436 transitions, 989 flow. Second operand has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:59,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:59,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 502 [2024-11-19 05:59:59,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:59,876 INFO L124 PetriNetUnfolderBase]: 130/2468 cut-off events. [2024-11-19 05:59:59,877 INFO L125 PetriNetUnfolderBase]: For 31/43 co-relation queries the response was YES. [2024-11-19 05:59:59,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 2468 events. 130/2468 cut-off events. For 31/43 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 17824 event pairs, 21 based on Foata normal form. 2/2339 useless extension candidates. Maximal degree in co-relation 2951. Up to 76 conditions per place. [2024-11-19 05:59:59,906 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 26 selfloop transitions, 5 changer transitions 0/443 dead transitions. [2024-11-19 05:59:59,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 443 transitions, 1073 flow [2024-11-19 05:59:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2024-11-19 05:59:59,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130146082337317 [2024-11-19 05:59:59,910 INFO L175 Difference]: Start difference. First operand has 454 places, 436 transitions, 989 flow. Second operand 6 states and 2750 transitions. [2024-11-19 05:59:59,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 443 transitions, 1073 flow [2024-11-19 05:59:59,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 443 transitions, 1025 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-11-19 05:59:59,918 INFO L231 Difference]: Finished difference. Result has 442 places, 435 transitions, 949 flow [2024-11-19 05:59:59,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=442, PETRI_TRANSITIONS=435} [2024-11-19 05:59:59,919 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -22 predicate places. [2024-11-19 05:59:59,919 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 435 transitions, 949 flow [2024-11-19 05:59:59,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:59,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:59,920 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] [2024-11-19 05:59:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:59:59,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:59:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1195452538, now seen corresponding path program 1 times [2024-11-19 05:59:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248371688] [2024-11-19 05:59:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:00:00,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248371688] [2024-11-19 06:00:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248371688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:00,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:00,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415295960] [2024-11-19 06:00:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:00,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:00,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:00,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 502 [2024-11-19 06:00:00,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 435 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:00,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:00,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 502 [2024-11-19 06:00:00,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:00,852 INFO L124 PetriNetUnfolderBase]: 110/2442 cut-off events. [2024-11-19 06:00:00,855 INFO L125 PetriNetUnfolderBase]: For 15/37 co-relation queries the response was YES. [2024-11-19 06:00:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 2442 events. 110/2442 cut-off events. For 15/37 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 17440 event pairs, 21 based on Foata normal form. 8/2313 useless extension candidates. Maximal degree in co-relation 2811. Up to 76 conditions per place. [2024-11-19 06:00:00,887 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 26 selfloop transitions, 5 changer transitions 0/442 dead transitions. [2024-11-19 06:00:00,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 442 transitions, 1033 flow [2024-11-19 06:00:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2024-11-19 06:00:00,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130146082337317 [2024-11-19 06:00:00,891 INFO L175 Difference]: Start difference. First operand has 442 places, 435 transitions, 949 flow. Second operand 6 states and 2750 transitions. [2024-11-19 06:00:00,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 442 transitions, 1033 flow [2024-11-19 06:00:00,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 442 transitions, 1023 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:00:00,898 INFO L231 Difference]: Finished difference. Result has 441 places, 434 transitions, 947 flow [2024-11-19 06:00:00,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=441, PETRI_TRANSITIONS=434} [2024-11-19 06:00:00,899 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places. [2024-11-19 06:00:00,900 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 434 transitions, 947 flow [2024-11-19 06:00:00,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:00,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:00,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:00:00,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:00:00,901 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:00:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -997663977, now seen corresponding path program 1 times [2024-11-19 06:00:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050049370] [2024-11-19 06:00:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:00:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:00,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050049370] [2024-11-19 06:00:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050049370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:00,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792868867] [2024-11-19 06:00:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:00,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:00,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 502 [2024-11-19 06:00:00,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 434 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 466.6666666666667) internal successors, (1400), 3 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:00,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:00,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 502 [2024-11-19 06:00:00,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:01,319 INFO L124 PetriNetUnfolderBase]: 101/2387 cut-off events. [2024-11-19 06:00:01,319 INFO L125 PetriNetUnfolderBase]: For 9/25 co-relation queries the response was YES. [2024-11-19 06:00:01,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 2387 events. 101/2387 cut-off events. For 9/25 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 17021 event pairs, 21 based on Foata normal form. 2/2263 useless extension candidates. Maximal degree in co-relation 2677. Up to 77 conditions per place. [2024-11-19 06:00:01,347 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 0 selfloop transitions, 0 changer transitions 435/435 dead transitions. [2024-11-19 06:00:01,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 975 flow [2024-11-19 06:00:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2024-11-19 06:00:01,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9349269588313412 [2024-11-19 06:00:01,350 INFO L175 Difference]: Start difference. First operand has 441 places, 434 transitions, 947 flow. Second operand 3 states and 1408 transitions. [2024-11-19 06:00:01,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 975 flow [2024-11-19 06:00:01,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 435 transitions, 965 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:00:01,355 INFO L231 Difference]: Finished difference. Result has 437 places, 0 transitions, 0 flow [2024-11-19 06:00:01,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=437, PETRI_TRANSITIONS=0} [2024-11-19 06:00:01,355 INFO L277 CegarLoopForPetriNet]: 464 programPoint places, -27 predicate places. [2024-11-19 06:00:01,355 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 0 transitions, 0 flow [2024-11-19 06:00:01,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 466.6666666666667) internal successors, (1400), 3 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:00:01,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2024-11-19 06:00:01,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2024-11-19 06:00:01,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2024-11-19 06:00:01,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2024-11-19 06:00:01,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2024-11-19 06:00:01,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2024-11-19 06:00:01,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2024-11-19 06:00:01,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2024-11-19 06:00:01,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2024-11-19 06:00:01,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2024-11-19 06:00:01,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2024-11-19 06:00:01,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2024-11-19 06:00:01,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2024-11-19 06:00:01,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2024-11-19 06:00:01,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2024-11-19 06:00:01,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2024-11-19 06:00:01,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2024-11-19 06:00:01,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2024-11-19 06:00:01,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2024-11-19 06:00:01,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2024-11-19 06:00:01,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2024-11-19 06:00:01,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2024-11-19 06:00:01,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2024-11-19 06:00:01,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2024-11-19 06:00:01,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2024-11-19 06:00:01,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2024-11-19 06:00:01,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2024-11-19 06:00:01,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2024-11-19 06:00:01,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:00:01,366 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] [2024-11-19 06:00:01,373 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 06:00:01,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:00:01,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:00:01 BasicIcfg [2024-11-19 06:00:01,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:00:01,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:00:01,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:00:01,379 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:00:01,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:45" (3/4) ... [2024-11-19 06:00:01,381 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:00:01,384 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 06:00:01,384 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 06:00:01,384 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 06:00:01,389 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-19 06:00:01,389 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 06:00:01,390 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 06:00:01,390 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:00:01,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:00:01,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:00:01,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:00:01,476 INFO L158 Benchmark]: Toolchain (without parser) took 16768.68ms. Allocated memory was 222.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 150.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 527.3MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,477 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 222.3MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:00:01,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.72ms. Allocated memory is still 222.3MB. Free memory was 149.9MB in the beginning and 135.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.37ms. Allocated memory is still 222.3MB. Free memory was 135.3MB in the beginning and 131.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,478 INFO L158 Benchmark]: Boogie Preprocessor took 45.49ms. Allocated memory is still 222.3MB. Free memory was 131.8MB in the beginning and 128.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,478 INFO L158 Benchmark]: RCFGBuilder took 824.34ms. Allocated memory is still 222.3MB. Free memory was 128.9MB in the beginning and 161.8MB in the end (delta: -32.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,479 INFO L158 Benchmark]: TraceAbstraction took 15471.95ms. Allocated memory was 222.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 161.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 533.0MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,479 INFO L158 Benchmark]: Witness Printer took 96.60ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 06:00:01,480 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.18ms. Allocated memory is still 222.3MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.72ms. Allocated memory is still 222.3MB. Free memory was 149.9MB in the beginning and 135.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.37ms. Allocated memory is still 222.3MB. Free memory was 135.3MB in the beginning and 131.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.49ms. Allocated memory is still 222.3MB. Free memory was 131.8MB in the beginning and 128.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 824.34ms. Allocated memory is still 222.3MB. Free memory was 128.9MB in the beginning and 161.8MB in the end (delta: -32.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15471.95ms. Allocated memory was 222.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 161.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 533.0MB. Max. memory is 16.1GB. * Witness Printer took 96.60ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 750 locations, 51 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: 15.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1972 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1086 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3343 IncrementalHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 181 mSDtfsCounter, 3343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=14, InterpolantAutomatonStates: 87, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2187 ConstructedInterpolants, 0 QuantifiedInterpolants, 3302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 6/6 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:00:01,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE